Two-Coloring Random Hypergraphs

Random Structures and Algorithms

Volumn 20, Issue 2, 2002, Pages 249-259

  Achlioptas, Dimitris ^a   Kim, Jeong Han ^a   Krivelevich, Michael ^b   Tetali, Prasad ^c  

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036103236     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.997     Document Type: Article

References (20)

1. N. Alon and J. Spencer, A note on coloring random k-sets. Unpublished manuscript.
2. J. Beck, On 3-chromatic hypergraphs. Discrete Math 24(2) (1978), 127-137.
3. C. Berge, Hypergraphs, North-Holland, Amsterdam, 1989. Combinatorics of finite sets, Translated from the French.
4. F. Bernstein, Zur theorie der trigonometrische reihen. Leipz Ber 60 (1908), 325-328.
5. B. Bollobás, Random Graphs, Academic Press, London, 1985.
6. M.-T. Chao, and J. Franco, Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem. Inform Sci 51(3) (1990), 289-314.
7. V. Chvátal and B. Reed, Mick gets some (the odds are on his side). In 33rd Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992). IEEE Comput Soc Press, Los Alamitos, CA, 1992, pp. 620-627.
8. P. Erdös, On a combinatorial problem. Nordisk Mat Tidskr 11 (1963), 5-10, 40.
9. P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions. Colloq. Math. Soc. János Bolyai, Vol. 10, 609-627.
10. P. Flajolet, D.E. Knuth, and B. Pittel, The first cycles in an evolving graph. Discrete Math 75, 1-3 (1989), 167-215. Graph theory and combinatorics, Cambridge, 1988.
11. P. Flajolet, D.E. Knuth, and B. Pittel, The first cycles in an evolving graph. Discrete Math 75, 1-3 (1989), 167-215. Graph theory and combinatorics, Cambridge, 1988.
12. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J Amer Math Soc 12 (1999), 1017-1054.
13. A.M. Frieze, and S. Suen, Analysis of two simple heuristics on a random instance of k-SAT. J Algorithms 20(2) (1996), 312-355.
14. M. Karoński, and T. Łuczak, Random hypergraphs, in Combinatorics, Paul Erdös is eighty, Vol. 2 (Kesztheley, 1993), 283-293, Bolyai Soc Math Stud 2, Janos Bolyai Math. Soc., Budapest, 1996.
15. M. Karoński, and T. Łuczak, Random hypergraphs, in Combinatorics, Paul Erdös is eighty, Vol. 2 (Kesztheley, 1993), 283-293, Bolyai Soc Math Stud 2, Janos Bolyai Math. Soc., Budapest, 1996.
16. M. Krivelevich, and B. Sudakov, The chromatic numbers of random hypergraphs. Random Structres Algorithms 12 (1998), 381-403.
17. L. Lovász, Coverings and coloring of hypergraphs. Proceedings of the Fourth South-eastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, 1973, pp. 3-12.
18. R. Monasson, and R. Zecchina, Entropy of the K-satisfiability problem. Phys Rev Lett 76(21) (1996), 3881-3885.
19. J. Radhakrishnan, and A. Srinivasan, Improved bounds and algorithms for hypergraph 2-coloring. Random Structures Algorithms 16(1) (2000), 4-32.
20. J. Schmidt-Pruzan, E. Shamir, and E. Upfal, Random hypergraph coloring algorithms and the weak chromatic number. J Graph Theory 8 (1985), 347-362.