Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Randomization and Approximation Techniques in Computer Science

International Workshop on Approximation Algorithms for Combinatorial Optimization

RANDOM 2004, APPROX 2004: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques pp 219–228Cite as

The Chromatic Number of Random Regular Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3122))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Achlioptas, D., Moore, C.: Almost all graphs of degree 4 are 3-colorable. Journal of Computer and System Sciences 67(4), 441–471 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Achlioptas, D., Moore, C.: The asymptotic order of the k-SAT threshold. In: Proc. 43rd Foundations of Computer Science, pp. 779–788 (2002)

    Google Scholar 

  3. Achlioptas, D., Moore, C.: On the two-colorability of random hypergraphs. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 78–90. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. In: Proc. 36th Symp. on the Theory of Computing (2004)

    Google Scholar 

  5. Bollobás, B.: Random graphs. Academic Press, London (1985)

    MATH  Google Scholar 

  6. Frieze, A., Luczak, T.: On the independence and chromatic numbers of random regular graphs. J. Combin. Theory Ser. B 54, 123–132 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Janson, S., Lucza, T., Ruciński, A.: Random Graphs. Wiley & Sons, Chichester (2000)

    MATH  Google Scholar 

  8. Krza̧ka_la, F., Pagnani, A., Weigt, M.: Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs. Preprint, cond-mat/0403725. Physical Review (to appear)

    Google Scholar 

  9. Luczak, T.: The chromatic number of random graphs. Combinatorica 11(1), 45–54 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Luczak, T.: A note on the sharp concentration of the chromatic number of random graphs. Combinatorica 11(3), 295–297 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. Molloy, M.: The Chromatic Number of Sparse Random Graphs. Master’s thesis, Faculty of Mathematics, University of Waterloo (1992)

    Google Scholar 

  12. Wormald, N.C.: Models of random regular graphs. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics., London Mathematical Society Lecture Note Series, vol. 276, pp. 239–298. Cambridge University Press, Cambridge (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, Redmond, WA, 98052, USA

    Dimitris Achlioptas

  2. University of New Mexico, NM, 87131, USA

    Cristopher Moore

Authors
  1. Dimitris Achlioptas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cristopher Moore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  2. Dept. of CIS, Univ. of Pennsylvania, 19104, Philadelphia, PA

    Sanjeev Khanna

  3. Centre Universitaire d’Informatique, Battelle Bâtiment A, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. Tel-Aviv University, Ramat Aviv, Israel

    Dana Ron

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27821-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22894-3

  • Online ISBN: 978-3-540-27821-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation