نتایج جستجو برای: modular edge coloring

تعداد نتایج: 168217  

Journal: :Journal of Graph Algorithms and Applications 1999

Journal: :Comput. Geom. 1998
Oswin Aichholzer Ferran Hurtado Marc Noy

We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33).  2004 Elsevier B.V. All rights reserved.

Journal: :CoRR 2012
J. Martin van Zyl Sean van der Merwe

Rating of researchers, and thus possibly also funding, is often based on the h-index or Hirsch index (Hirsch, 2005) which in turn is a function of the number of publications and citations received based on their publications. Impact numbers of journals are also based on citations. The purpose of this work is to show the differences between the average number of citations for various subject fie...

2013
Daron Acemoglu Tristan Reed James A. Robinson

Table B1 presents results from a specification identical to the one presented in Table 2 of the paper using an alternative measure of the concentration of power. This measure is the number of times the family that has held the paramount chieftaincy most has done so (i.e., the maximum of the number of times any family has held the chieftaincy). The mean of this variable is 3.5. The results are v...

2015
Richard M. Ross Aradhna Agarwal Cynthia Sieck

Journal: :Australasian J. Combinatorics 2006
Hungyung Chang Xuding Zhu

2003
Miguel Martín

Given an infinite-dimensional Banach space X, we introduce the daugavetian index of X , daug (X), as the greatest constant m > 0 such that kId+ Tk > 1 +mkTk for all T ∈ K(X). We givetwo characterizations of this index and we estimate it in some examples. We show that the daugavetian index of a c0-, l1or l∞-sum of Banach spaces is the infimum index of the summands. Finally, we calculate the daug...

Journal: :Discrete Mathematics 2002
Dhruv Mubayi Douglas B. West

We investigate the minimum and maximum number of colors in edge-colorings of Kn,n such that every copy of Kp,p receives at least q and at most q′ colors. Along the way we improve the bounds on some bipartite Turán numbers.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید