62 search results - page 2 / 13 » On the chromatic number of random geometric graphs |
APPROX
2004
Springer
13 years 10 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...
STOC
2004
ACM
14 years 5 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
13 years 11 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 χ...
COMBINATORICS
2007
13 years 4 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
DAM
2008
13 years 5 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...