Almost all graphs with 2:522n edges are not 3-colorable

Electronic Journal of Combinatorics

Volumn 6, Issue 1, 1999, Pages

  Achlioptas, Dimitris ^a,b   Molloy, Michael ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002403658     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1461     Document Type: Article

References (18)

1. D. Achlioptas, E. Friedgut, A sharp threshold for k-colorability, Random Structures & Algorithms, 14 (1999), 63-70.
2. D. Achlioptas, M. Molloy, The analysis of a list-coloring algorithm on a random graph, 38th Annual Symposium on Foundations of Computer Science, Miami, FL (1997), 204-212.
3. N. Alon, J.H. Spencer, The Probabilistic Method, with an Appendix of open problems by P. Erdos, J. Wiley & Sons, New York, 1992.
4. V. Chvatal, Almost all graphs with 1:44n edges are 3-colorable, Random Structures & Algorithms, 2 (1991), 11-28.
5. P. Erdos, A. Rényi, On the evolution of random graphs, Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5 (1960), 17-61.
6. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem, Journal of the American Mathematical Society, 12 (1999), 1017-1054.
7. G.R. Grimmett, C.J.H. McDiarmid, On colouring random graphs, Mathematical Proceedings of the Cambridge Philosophical Society, 77 (1975), 313-324.
8. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou, Approximating the unsatisfiability threshold of random formulas, Random Structures & Algorithms, 12 (1998), 253-269.
9. L. M. Kirousis, Y. Stamatiou, An inequality for reducible increasing properties of random words, Technical Report, Computer Technology Institute, Greece, (1997), 1-3.
10. T. Luczak, The chromatic number of random graphs, Combinatorica, 11 (1991), 45-54.
11. T. Luczak, Size and connectivity of the k-core of a random graph, Discrete Mathematics, 91 (1991), 61-68.
12. C.J.H. McDiarmid, On a correlation inequality of Farr, Combinatorics, Probability and Computing, 1 (1992), 157-160.
13. M. Molloy, The chromatic number of sparse random graphs, M. Math Thesis, University of Waterloo, (1992).
14. M. Molloy, A gap between the appearances of a k-core and a (k + 1)-chromatic graph, Random Structures & Algorithms, 8 (1996), 159-160.
15. M. Molloy, B. Reed, A critical point for random graphs with a given degree sequence, Random Structures & Algorithms, 6 (1995), 161-179.
16. B. Pittel, J.H. Spencer, and N.C. Wormald, Sudden emergence of a giant k-core in a random graph, Journal of Combinatorial Theory Series B, 67 (1996), 111-151.
17. W.H. Press, S. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical recipes in C, Cambridge University Press, Cambridge, 1992.
18. D. Redfern, The Maple Handbook: Maple V Release 3, Springer, New York, 1994.