On the chromatic number of random graphs

  • Authors:

  • Amin Coja-Oghlan;Konstantinos Panagiotou;Angelika Steger

  • Affiliations:

  • Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA;Institute of Theoretical Computer Science, ETH Zurich, 8092 Zurich, Switzerland;Institute of Theoretical Computer Science, ETH Zurich, 8092 Zurich, Switzerland

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider the classical Erdos-Renyi model of random graphs G"n","p. We show that for p=p(n)=0, the chromatic number @g(G"n","p) is a.a.s. @?, @?+1, or @?+2, where @? is the maximum integer satisfying 2(@?-1)log(@?-1)=