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. © Springer-Verlag 2004.
Cite
CITATION STYLE
APA
Achlioptas, D., & Moore, C. (2004). The chromatic number of random regular graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3122, 219–228. https://doi.org/10.1007/978-3-540-27821-4_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free