The Chromatic Number of Random Regular Graphs

  • Dimitris Achlioptas
  • Cristopher Moore
Conference paper

DOI: 10.1007/978-3-540-27821-4_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3122)
Cite this paper as:
Achlioptas D., Moore C. (2004) The Chromatic Number of Random Regular Graphs. In: Jansen K., Khanna S., Rolim J.D.P., Ron D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Dimitris Achlioptas
    • 1
  • Cristopher Moore
    • 2
  1. 1.Microsoft ResearchRedmondUSA
  2. 2.University of New MexicoUSA

Personalised recommendations