Sciweavers

STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 23 days ago
The two possible values of the chromatic number of a random graph
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.
Dimitris Achlioptas, Assaf Naor