arXiv · cond-mat/0407278
The Chromatic Number of Random Regular Graphs
Abstract
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, and that if (2k-1) \log k < d < 2k \log k then the chromatic number is either k+1 or k+2.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dimitris Achlioptas, Cristopher Moore. 2004-07-11. The Chromatic Number of Random Regular Graphs. https://arxiv.org/abs/cond-mat/0407278
Cite the original work for its findings. Save a collection to share your selection of sources.