论文信息 - On the chromatic number of random graphs

On the chromatic number of random graphs

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)=

Konstantinos Panagiotou | Amin Coja-Oghlan | Angelika Steger

[1] D. Achlioptas,et al. A sharp threshold for k-colorability , 1999 .

[2] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[3] Tomasz Luczak. A note on the sharp concentration of the chromatic number of random graphs , 1991, Comb..

[4] Paul Erdös,et al. On random graphs, I , 1959 .

[5] A. Naor,et al. The two possible values of the chromatic number of a random graph , 2005 .

[6] Joel H. Spencer,et al. Sharp concentration of the chromatic number on random graphsGn, p , 1987, Comb..

[7] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..

[8] Noga Alon,et al. The concentration of the chromatic number of random graphs , 1997, Comb..

[9] Béla Bollobás,et al. The chromatic number of random graphs , 1988, Comb..

[10] W. T. Gowers,et al. RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .