Almost all graphs with average degree 4 are 3-colorable

Journal of Computer and System Sciences

Volumn 67, Issue 2, 2003, Pages 441-471

  Achlioptas, Dimitris ^a   Moore, Christopher ^b,c  

^a MICROSOFT RESEARCH   (United States)

^b University of New Mexico   (United States)

^c SANTA FE INSTITUTE   (United States)

Author keywords

Graph coloring; Random graphs; Regular random graphs; Threshold phenomena

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; DIFFERENTIAL EQUATIONS; HEURISTIC METHODS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING;

GRAPH COLORING; MULTITYPE BRANCHING PROCESS; RANDOM GRAPHS; REGULAR RANDOM GRAPHS; THRESHOLD PHENOMENA;

GRAPH THEORY;

EID: 0142091449     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00120-X     Document Type: Article

References (25)

1. D. Achlioptas, Threshold phenomena in random graph coloring and satisfiability, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1999.
2. D. Achlioptas, Setting two variables at a time yields a new lower bound for random 3-SAT, in: 32nd Annual ACM Symposium on Theory of Computing (Portland, OR, 2000), ACM, New York, 2000, pp. 28-37.
3. D. Achlioptas, E. Friedgut, A sharp threshold for k-colorability, Random Struct. Algorithms 14 (1) (1999) 63-70.
4. D. Achlioptas, M. Molloy, The analysis of a list-coloring algorithm on a random graph, in: 38th Annual Symposium on Foundations of Computer Science (Miami, FL, 1997), IEEE Comput. Soc. Press, Los Alamitos, CA, 1997, pp. 204-212.
5. E. Bender, E. Canfield, The asymptotic number of labelled graphs with given degree sequences, J. Combin. Theory Ser. A 24 (1978) 296-307.
6. S. Boettcher, A. Percus, Optimization with extremal dynamics, Phys. Rev. Lett. 86 (2001) 5211-5214.
7. B. Bollobás, Random Graphs, Academic Press, London, New York, 1985.
8. D. Brelaz, New methods to color the vertices of a graph, Comm. ACM 22 (1979) 251-256.
9. V. Chvátal, Almost all graphs with 1.44n edges are 3-colorable, Random Struct. Algorithms 2 (1) (1991) 11-28.
10. P. Erdos, A. Rényi, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960) 17-61.
11. A.C. Kaporis, L.M. Kirousis, Y.C. Stamatiou, A note on the non-colorability threshold of a random graph, Electron. J. Combin. 7 (2000) R29.
12. R. Karp, M. Sipser, Maximum matchings in sparse random graphs, in: 22nd Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 1981, pp. 364-375.
13. D.E. Knuth, R. Motwani, B. Pittel, Stable husbands, Random Struct. Algorithms 1 (1) (1990) 1-14.
14. T.G. Kurtz,e Solutions of ordinary differential equations as limits of pure jump Markov processes, J. Appl. Probab. 7 (1970) 49-58.
15. T.G. Kurtz, Approximation of Population Processes, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1981.
16. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, V. Stemann, Practical loss-resilient codes, in: Proceedings of the 29th ACM Annual Symposium on the Theory of Computing, ACM, New York, 1997.
17. T. Luczak, Size and connectivity of the k-core of a random graph, Discrete Math. 91 (1) (1991) 61-68.
18. M. Mitzenmacher, Analyses of load stealing models based on families of differential equations, Theory Comput. System 34 (1) (2001) 77-98.
19. M. Mitzenmacher, Studying balanced allocations with differential equations, Combin. Probab. Comput. 8 (5) (1999) 473-482.
20. C.J. Mode, Multitype Branching Processes. Theory and Applications, American Elsevier Publishing Co., Inc, New York, 1971.
21. M. Molloy, B. Reed, A critical point for random graphs with a given degree sequence, Random Struct. Algorithms 6 (2-3) (1995) 161-179.
22. R. Mulet, A. Pagnani, M. Weigt, R. Zecchina, Coloring random graphs, Phys. Rev. Lett. 89 (2002) 268701.
23. B. Pittel, J.H. Spencer, N.C. Wormald, Sudden emergence of a giant k-core in a random graph, J. Combin. Theory Ser. B 67 (1) (1996) 111-151.
24. N. Wormald, Some problems in the enumeration of labelled graphs, Ph.D. Thesis, Newcastle University, 1978.
25. N.C. Wormald, Differential equations for random processes and random graphs, Ann. Appl. Probab. 5 (4) (1995) 1217-1235.