Sharp concentration of the chromatic number on random graphsG n, p
- 490 Downloads
The distribution of the chromatic number on random graphsG n, p is quite sharply concentrated. For fixedp it concentrates almost surely in √n ω(n) consecutive integers where ω(n) approaches infinity arbitrarily slowly. If the average degreepn is less thann 1/6, it concentrates almost surely in five consecutive integers. Large deviation estimates for martingales are used in the proof.
AMS subject classification (1980)05 C 15 60 C 05
Unable to display preview. Download preview PDF.
- W. F. de la Vega, On the Chromatic number of sparge random graphs, n:Graph theory and combinatorics (ed. B. Bollobás) Academic Press, London, 1984, 321–328.Google Scholar
- P. Erdős andJ. Spencer,Probabilistic Methods in Combinatorics, Academic Press, New York, 1974.Google Scholar
- V. Milman andG. Schechtman,Asymptotic theory of normed linear spaces, Lecture Notes in Mathematics, Springer.Google Scholar