The Chromatic Number of Random Regular Graphs

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.

• Type: Conference
• Year: 2004
• Where: APPROX
• Authors: Dimitris Achlioptas, Cristopher Moore
• Keywords: Algorithms, APPROX 2004, Log K, Random D-regular Graph, Smallest Integer