On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs

Journal of Graph Theory

Volumn 31, Issue 3, 1999, Pages 201-226

  Vu, Van H ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Choice number; Chromatic number; Locally sparse graphs; Nibble method; Random graphs

Indexed keywords

EID: 0033465460     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199907)31:3<201::AID-JGT5>3.0.CO;2-T     Document Type: Article

References (26)

1. N. Alon, Restricted colorings of graphs, Survey in Combin, Proc 14th Br Comb Conf, London Math Soc Lect Notes Ser 187, K. Walker (Editor), Cambridge Univ Press, 1993, pp. 1-33.
2. N. Alon and J. Spencer, The probabilistic method, Wiley, New York, 1992.
3. N. Alon, M. Krivelevich, and Sudakov, List coloring of random and pseudorandom graphs, to appear.
4. N. Alon, M. Krivelevich, and Sudakov, Coloring graphs with sparse neighborhoods, to appear.
5. L. Babai, A. Gál, and A. Wigderson, Super polynomial bounds for monotone span programs, Combin, to appear.
6. L. Babai and P. Frankl, Linear algebra methods in combinatorics, monograph in preprint.
7. B. Bollobás, Random graphs, Academic, London, 1985.
8. B. Bollobás, The chromatic number of random graphs, Combin 8 (1988), 49-55.
9. P. Erdos, A. L. Rubin, and H. Taylor, Choosability in graphs, Proc W Coast Conf Comb Graph Theory Comp, Congr Numer XXVI, 1979, 125-157.
10. U. Feige, Personal communication.
11. A. Frieze and C. J. H. McDiarmid, Algorithmic theory of random graphs, Random Struct Algorith 10 (1997), 5-42.
12. Grimmett and C. J. H. McDiarmid, On coloring random graphs, Proc Cambridge Philo Soc 77 (1971) 313-324.
13. A. Johansson, Asymptotic choice number for triangle free graphs, DIMACS Tech Rep (1996), 91-95.
14. A. Johansson, The choice number of sparse graphs, preprint.
15. S. Janson, Poisson approximation for large deviation, Random Struct Algorith 1 (1990), 221-231.
16. J. Kahn, Asymptotically good list-colorings, J Combin Th (A) 73 (1996), 1-59.
17. J. Kahn, Recent results on some not-so-recent hypergraph matching and covering problems, Proc Visegrad Conf Finite Sets, 1990.
18. Karp, "Reducibility among combinatorial problems," Complexity of computer computations, Plenum, New York, 1972, pp. 85-103.
19. J. H. Kim, On Brooks' theorem for sparse graphs, Comb Prob Comp 4 (1995), 97-132.
20. A. Kostochka and N. Mazurova, An inequality in the theory of graph coloring, Diskret Analiz 30 (1977), 23-29.
21. T. Łuczak, The chromatic number of random graphs, Combin 11 (1991), 45-54.
22. D. W. Matula, Expose-and-merge exploration and the chromatic number of random graphs, Combin 9 (1987), 275-284.
23. A. Thomasson, "Pseudo-random graphs," Survey in combinatorics, London Math Soc Lect Notes Ser 123, 1987.
24. V. G. Vizing, Coloring the vertices of a graph in prescribed colors, Diskret Analiz 29, Metody Diskret Anal v Teorii Kodov i Shem 101 (1976), 3-10 (in Russian).
25. V. H. Vu, A small strongly regular r - full graph, Combin 16 (1996), 295-299.
26. V. H. Vu, On the choice number of random hypergraphs, Combin Prob Comp, to appear.