On the concentration of the chromatic number of random graphs
Combinatorics
2017-10-19 v2
Abstract
Let 0<p<1 be fixed. Shamir and Spencer proved in the 1980s that the chromatic number of a random graph in G(n,p) is concentrated in an interval of length about n^{1/2}. In this explanatory note, we give a proof of a result due due Noga Alon, showing that the chromatic number is concentrated in an interval of length about n^{1/2}/log n.
Cite
@article{arxiv.0806.0178,
title = {On the concentration of the chromatic number of random graphs},
author = {Alex Scott},
journal= {arXiv preprint arXiv:0806.0178},
year = {2017}
}