On the 2-colorability of random hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2483, Issue , 2002, Pages 78-90

  Achlioptas, Dimitris ^a   Moore, Cristopher ^b,c  

^a MICROSOFT RESEARCH   (United States)

^b University of New Mexico   (United States)

^c SANTA FE INSTITUTE   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES;

HIGH PROBABILITY; HYPERGRAPH; TWO-COLOR;

GRAPH THEORY;

EID: 84959063783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_7     Document Type: Conference Paper

References (20)

1. Achlioptas, D., Kim, J.H., Krivelevich, M. and Tetali, P. Two-coloring random hypergraphs. Random Structures Algorithms, 20 (2): 249-259, 2002.
2. Achlioptas, D., and Moore, C. The asymptotic order of the random k-SAT threshold. To appear in 43rd Annual Symposium on Foundations of Computer Science (Vancouver, BC, 2002).
3. Alon, N., and Spencer, J. Anote on coloring random k-sets. Unpublished manuscript.
4. Beck, J. On 3-chromatic hypergraphs. Discrete Math. 24, 2 (1978), 127-137.
5. Berge, C. Hypergraphs. North-Holland Publishing Co., Amsterdam, 1989. Combinatorics of finite sets, Translated from the French.
6. Bernstein, F. Zur theorie der trigonometrische reihen. Leipz. Ber. 60, (1908), 325-328.
7. Chao, M.-T., and Franco, J. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem. Inform. Sci. 51, 3 (1990), 289-314.
8. Chvátal, V., and Reed, B. 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.
9. de Bruijn, N.G. Asymptotic Methods in Analysis. North-Holland, 1958.
10. Erdos, P. On a combinatorial problem. Nordisk Mat. Tidskr. 11 (1963), 5-10, 40.
11. Erdos, P., and Lovász, L. Problems and results on 3-chromatic hypergraphs and some related questions. 609-627. Colloq. Math. Soc. János Bolyai, Vol. 10.
12. Flajolet, P., Knuth, D. E., and Pittel, B. The first cycles in an evolving graph. Discrete Math. 75, 1-3 (1989), 167-215. Graph theory and combinatorics (Cambridge, 1988).
13. Friedgut, E. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J. Amer. Math. Soc. 12 (1999), 1017-1054.
14. Frieze, A. and McDiarmid, C. Algorithmic theory of random graphs. Random Struct. Alg. 10, (1997), 5-42.
15. Karoński, M. and Luczak, T. Random hypergraphs. Combinatorics, Paul Erdos is eighty, Vol. 2 (Kesztheley, 1993), 283-293, Bolyai Soc. Math. Stud., 2, Janos Bolyai Math. Soc., Budapest, 1996.
16. Krivelevich, M. and Sudakov, B. The chromatic numbers of random hypergraphs. Random Struct. Alg. 12, (1998), 381-403.
17. Lovász, L. Coverings and coloring of hypergraphs. Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Florida, 1973), 3-12.
18. Motwani, R. and Raghavan, P. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
19. Radhakrishnan, J., and Srinivasan, A. Improved bounds and algorithms for hypergraph 2-coloring. Random Structures Algorithms 16, 1 (2000), 4-32.
20. Schmidt-Pruzan, J., and Shamir, E., and Upfal, E. Random hypergraph coloring algorithms and the weak chromatic number. Journal of Graph Theory 8, (1985), 347-362.