5-regular graphs are 3-colorable with positive probability

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 215-225

  Diaz J ^a   Grammatikopoulos, G ^b,c   Kaporis, A C ^b   Kirousis, L M ^b,c   Perez X ^a   Sotiropoulos, D G ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF PATRAS   (Greece)

^c University of Patras and Computer Technology Institute   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; RANDOM PROCESSES;

POSITIVE PROBABILITY; REGULAR GRAPHS; VERTICES;

GRAPH THEORY;

EID: 27144473642     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_21     Document Type: Conference Paper

References (14)

1. D. Achlioptas and C. Moore. The asymptotic order of the random k-SAT threshold. In: Proc. 43th Annual Symp. on Foundations of Computer Science (FOCS), 126-127, 2002.
2. D. Achlioptas and C. Moore. Almost all graphs with degree 4 are 3-colorable. Journal of Computer and Systems Sciences 67(2), 441-471, 2003.
3. D. Achlioptas and C. Moore. The chromatic number of random regular graphs. In: Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) and 8th International Workshop on Randomization and Computation (RANDOM) (Springer, LNCS, 2004) 219-228.
4. D. Achlioptas and A. Naor. The two possible values of the chromatic number of a random graph. In: 36th Symposium on the Theory of Computing (STOC), 587-593, 2004.
5. B. Bollobás. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics 1, 311-316, 1980.
6. B. Bollobás. Random Graphs. Academic Press, London-New York, 1985.
7. R.H. Byrd, P. Lu and J. Nocedal. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific and Statistical Computing 16(5), 1190-1208, 1995.
8. S. Janson, T. Luczak and A. Ruciński. Random Graphs. John Wiley, 2000.
9. F. Krza̧kała, A. Pagnani and M. Weigt. Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs. Phys. Rev. E 70, 046705 (2004).
10. T. Łuczak. The chromatic number of random graphs Combinatorica 11, 45-54, 1991.
11. M. Mézard and R. Zecchina. Random K-satisfiability: from an analytic solution to a new efficient algorithm. Phys.Rev. E 66, 056126 (2002).
12. M. Molloy. The Chromatic Number of Sparse Random Graphs. Master's Thesis, University of Waterloo, 1992.
13. L. Shi and N. Wormald. Colouring random regular graphs Research Report CORR 2004-24, Faculty of Mathematics, University of Waterloo, 2004.
14. N.C. Wormald. Models of random regular graphs. In: J.D. Lamb and D.A. Preece, eds., Surveys in Combinatorics (London Mathematical Society Lecture Notes Series, vol. 267, Cambridge U. Press, 1999) 239-298.