On the Chromatic Number of Random Graphs

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 χ(Gn,p) is a.a.s. , +1, or +2, where is the maximum integer satisfying 2( −1) log( −1) ≤ p(n−1).

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger
• Keywords: Classical Erd˝os-r´enyi Model, ICALP 2007, P, Random Graphs Gn, Theoretical Computer Science