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.

• Type: Conference
• Year: 2004
• Where: STOC
• Authors: Dimitris Achlioptas, Assaf Naor
• Keywords: Algorithms, Random Graph G(n, Smallest Integer, STOC 2004