The Choice Number of Dense Random Graphs

Combinatorics Probability and Computing

Volumn 9, Issue 1, 2000, Pages 19-26

  Krivelevich, Michael ^a,b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034380792     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399004101     Document Type: Article

References (14)

1. Alon, N. (1992) Choice numbers of graphs: a probabilistic approach. Combinatorics, Probability and Computing 1 107-114.
2. Alon, N. (1993) Restricted colorings of graphs. In Surveys in Combinatorics, Proc. 14th British Combinatorial Conference, Vol. 187 of London Math. Soc. Lecture Notes (K. Walker, ed.), Cambridge University Press, pp. 1-33.
3. Alon, N., Krivelevich, M. and Sudakov, B. List coloring of random and pseudo-random graphs. Combinatorica, in press.
4. Alon, N. and Spencer, J. H. (1992) The Probabilistic Method, Wiley, New York.
5. Bollobás, B. (1985) Random Graphs, Academic Press, New York.
6. Bollobás, B. (1988) The chromatic number of random graphs. Combinatorica 8 49-55.
7. Erdos, P., Gyárfás, A. and Luczak, T. (1994) Independent transversals in sparse partite hypergraphs. Combinatorics, Probability and Computing 3 293-296.
8. Erdos, P. and Lovász, L. (1975) Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets (A. Hajnal, et al., eds), North Holland, Amsterdam, pp. 609-628.
9. Erdos, P., Rubin, A. L. and Taylor, H. (1979) Choosability in graphs. In Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI 125-157.
10. Łuczak, T. (1991) The chromatic number of random graphs. Combinatorica 11 45-54.
11. Spencer, J. (1995) Probabilistic methods in combinatorics. In Proceedings Int. Congress of Math. Zürich, 1994, Birkhäuser, Basel, pp. 1375-1383.
12. Vizing, V. G. (1976) Coloring the vertices of a graph in prescribed colors. Diskret. Analiz. 29, Metody Diskret. Anal. v. Teorii Kodov i Shem 101 3-10. In Russian.
13. Vizing, V. G. (1976) Coloring the vertices of a graph in prescribed colors. Diskret. Analiz. 29, Metody Diskret. Anal. v. Teorii Kodov i Shem 101 3-10. In Russian.
14. Vu, V. H. (1999) On some simple degree conditions which guarantee the upper bound on the chromatic (choice) number of random graphs. J. Graph Theory 31 201-226.