26 search results - page 2 / 6 » The t-Improper Chromatic Number of Random Graphs |
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 χ...
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...
COMBINATORICA
2011
12 years 5 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
CPC
2002
13 years 5 months ago
2002
COMBINATORICS
2007
13 years 5 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...