On the chromatic number of random regular graphs
Combinatorics
2013-08-21 v1 Probability
Abstract
Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}.
Cite
@article{arxiv.1308.4287,
title = {On the chromatic number of random regular graphs},
author = {Amin Coja-Oghlan and Charilaos Efthymiou and Samuel Hetterich},
journal= {arXiv preprint arXiv:1308.4287},
year = {2013}
}