3204 search results - page 10 / 641 » The Alcuin Number of a Graph |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
DM
1998
13 years 7 months ago
1998
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
SIAMDM
1998
13 years 7 months ago
1998
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...