The two possible values of the chromatic number of a random graph (Q5920569)

It is proved by analytical methods that the chromatic number of a random graph \(G(n,p)\) of fixed average degree \(d=np<2k \log k\) is almost surely equal to either \(k\) or \(k+1\) if \(d\) is at least \(2(k-1)\log(k-1)\) and almost surely equal to \(k+1\) if \(d\) is at least \((2k-1)\log\, k\).