نتایج جستجو برای: tucker
تعداد نتایج: 3427 فیلتر نتایج به سال:
We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 38n. This was suggested and later conjectured by Albertson, Bollobás, and Tucker.
Progeny of Plasmodium falciparum 2 Matthew S. Tucker**, Tina Mutka, Kansas Sparks, Janus Patel, and Dennis E. Kyle* 3 Department of Global Health, College of Public Health, University of South Florida, 3720 4 Spectrum Blvd, Tampa, FL. 33612, USA 5
In this paper, we consider the width invariant trapezoidal and triangularapproximations of fuzzy numbers. The presented methods avoid the effortful computation of Karush-Kuhn-Tucker Theorem. Some properties of the new approximation methods are presented and the applicability of the methods is illustrated by examples. In addition, we show that the proposed approximations of fuzzy numbers preserv...
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید