The Chromatic Number of Random Regular Graphs

* Final gross prices may vary according to local VAT.

Get Access


Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k+1, or k+2.