The chromatic numbers of random hypergraphs

Random Structures and Algorithms

Volumn 12, Issue 4, 1998, Pages 381-403

  Krivelevich, Michael ^a   Sudakov, Benny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Chromatic number; Random hypergraphs

Indexed keywords

EID: 0032345521     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199807)12:4<381::AID-RSA5>3.0.CO;2-P     Document Type: Article

References (14)

1. N. Alon and M. Krivelevich, The concentration of the chromatic number of random graphs, Combinatorica, 17, 303-313 (1997).
2. N. Alon and J. Spencer, The Probabilistic Method, Wiley, New York, 1992.
3. C. Berge, Hypergraphs, North-Holland, Amsterdam, 1989.
4. B. Bollobás, The chromatic number of random graphs, Combinatorica, 8, 49-55 (1988).
5. B. Bollobás, Random Graphs, Academic Press, London, 1985.
6. M. Karoński and T. Łuczak, Random hypergraphs, in Combinatorics, Paul Erdös is eighty, D. Miklós et al., Eds., Bolyai Soc. Math. Studies, Vol. 2, pp. 283-293.
7. T. Łuczak, The chromatic number of random graphs, Combinatorica, 11, 45-54 (1991).
8. T. Łuczak, A note on the sharp concentration of the chromatic number of random graphs, Combinatorica, 11, 45-54 (1991).
9. D. Matula, Expose-and-merge exploration and the chromatic number of a random graph, Combinatorica, 1, 275-284 (1987).
10. J. P. Schmidt, Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number, Discrete Math., 66, 259-277 (1987).
11. J. Schmidt-Pruzan, E. Shamir, and E. Upfal, Random hypergraph coloring algorithms and the weak chromatic number, J. Graph. Theory, 8, 347-362 (1985).
12. E. Shamir, Chromatic number of random hypergraphs and associated graphs, Adv. Comput. Res., 5, 127-142 (1989).
13. n, p, Combinatorica, 7, 121-130 (1987).
14. J. Spencer, Probabilistic methods in combinatorics, Proceedings of the International Congress of Mathematics, Zürich, 1994, pp. 1375-1381.