On the Choice Number of Random Hypergraphs

Combinatorics Probability and Computing

Volumn 9, Issue 1, 2000, Pages 79-95

  Vu, Van H ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442296129     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399004095     Document Type: Article

References (28)

1. Achlioptas, D. and Friedgut, E. A sharp threshold for k-colorability. Preprint.
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. and Krivelevich, M. (1997) On the concentration of the chromatic number of random graphs. Combinatorica 17 401-426.
4. Alon, N., Krivelevich, M. and Sudakov, B. List coloring of random and pseudo-random graphs. Submitted.
5. Alon, N. and Spencer, J. (1992) The Probabilistic Method, Wiley, New York.
6. Bollobás, B. (1985) Random Graphs, Academic Press, London.
7. Bollobás, B. (1988) The chromatic number of random graphs. Combinatorica 8 49-55.
8. 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.
9. Frieze, A. and McDiarmid, C. J. H. (1997) Algorithmic theory of random graphs. Random Struct. Algorithms 10 5-42.
10. Grimmett, G. R. and McDiarmid, C. J. H. (1971) On coloring random graphs. Proc. Cambridge Philosophical Soc. 77 313-324.
11. Jensen, T. R. and Toft, B. (1995) Graph Coloring Problems, Wiley.
12. Johansson, A. (1996) Asymptotic choice number for triangle free graphs. DIMACS Technical Report 91-95.
13. Karonski, M. and Luczak, T. (1996) Random hypergraphs. In Combinatorics, Paul Erdos is Eighty, Vol. 2, Bolyai Society Math. Studies, Keszthely, pp. 283-293.
14. Kim, J. H. (1995) On Brooks' theorem for sparse graphs. Combinatorics, Probability and Computing 4 97-132.
15. Kim, J. H. and Vu, V. H. Concentration of multivariate polynomials and applications. To appear in Combinatorica.
16. Kostochka, A. and Mazurova, N. (1977) An inequality in the theory of graph coloring. Diskret. Analiz. 30 23-29.
17. Krivelevich, M. and Sudakov, B. (1998) The chromatic number of random hypergraphs. Random Struct. Algorithms 12 381-402.
18. Krivelevich, M. and Vu, V. H. The weak choice number of random hypergraphs. In preparation.
19. Lovász, L. (1979) Problems and Exercises in Combinatorics, North Holland, Chapter 7.
20. Łuczak, T. (1991) The chromatic number of random graphs. Combinatorica 11 45-54.
21. Łuczak, T. (1991) A note on the sharp concentration of the chromatic number of random graphs. Combinatorica 11 295-297.
22. Matula, D. W. (1987) Expose-and-merge exploration and the chromatic number of random graphs. Combinatorica 9 275-284.
23. Schmidt, J. (1987) Probabilistic analysis of strong hypergraph coloring algorithm and the strong chromatic number. Discrete Math. 66 259-277.
24. Schmidt-Pruzan, J., Shamir, E. and Upfal, E. (1985) Random hypergraph coloring and the weak chromatic number. J. Graph Theory 9 347-362.
25. Shamir, E. (1989) Chromatic numbers of random hypergraphs and associated graphs. Advances in Computing Research 5 127-142.
26. 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.
27. 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.
28. 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.