Improved bounds and algorithms for hypergraph 2-coloring

Random Structures and Algorithms

Volumn 16, Issue 1, 2000, Pages 4-32

  Radhakrishnan, Jaikumar ^a   Srinivasan, Aravind ^b  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034406591     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200001)16:1<4::AID-RSA2>3.0.CO;2-2     Document Type: Article

References (29)

1. N. Alon, A parallel algorithmic version of the Local Lemma, Random Structures Algorithms 2 (1991), 367-378.
2. N. Alon and Z. Bregman, Every 8-uniform 8-regular hypergraph is 2-colorable, Graphs Combin 4 (1988), 303-305.
3. N. Alon, P. Kelsen, S. Mahajan, and H. Ramesh, Approximate hypergraph coloring, Nordic J on Computing 3 (1996), 425-439.
4. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley-Interscience Series, John Wiley and Sons, Inc., New York, 1992.
5. G. Andersson and L. Engebretsen, Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT, Inform Process Lett 65 (1998), 305-311.
6. J. Beck, On 3-chromatic hypergraphs, Discrete Math 24 (1978), 127-137.
7. J. Beck, An algorithmic approach to the Lovász Local Lemma, Random Structures Algorithms 2 (1991), 343-365.
8. F. Bernstein, Zur Theorie der trigonometrische Reihen, Leipz. Ber. 60 (1908), 325-328.
9. H. Chen and A. Frieze, Coloring bipartite hypergraphs, Proceedings of the MPS Conference On Integer Programming Combinatorial Optimization, Lecture Notes in Computer Science 1084, Springer-Verlag, Berlin, (1996), pp. 345-358.
10. P. Erdos, On a combinatorial problem, I. Nordisk Mat. Tidskrift, 11 (1963), 5-10.
11. P. Erdos, On a combinatorial problem, II, Acta Math, Hungary, 15 (1964), 445-447.
12. P. Erdos and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, A. Hajnal et. al., Eds., Colloq. Math. Soc. J. Bolyai 11, North Holland, Amsterdam, pp. 1975, 609-627.
13. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličković. Approximations of general independent distributions. Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, pp. 10-16, 1992.
14. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličkovič, Efficient approximations for product distributions, Random Structures Algorithms, 13 (1998), 1-16.
15. C. M. Fortuin, J. Ginibre, and P. N. Kasteleyn, Correlational inequalities for partially ordered sets, Comm Math Phys, 22 (1971), 89-103.
16. M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, W. H. Freeman and Company, New York, 1978 (printing updated in 1991).
17. T. R. Jensen and B. Toft, Graph coloring problems, Wiley-Interscience Series John Wiley & Sons, Inc., 1995.
18. D. R. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, J ACM, 45 (1998), 246-265.
19. M. Krivelevich and B. Sudakov, Approximate coloring of uniform hypergraphs, Proceedings of the European Symposium on Algorithms, 1998, pp. 477-489.
20. L. Lovász, Covering and coloring of hypergraphs, Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Publishing, Winnipeg, 1973, pp. 3-12.
21. C. McDiarmid, A random recolouring method for graphs and hypergraphs, Combin, Probab Comput 2 (1993), 363-365.
22. C. McDiarmid, Hypergraph colouring and the Lovász Local Lemma, Discrete Math, 167/168 (1997), 481-486.
23. E. W. Miller, On a property of families of sets, C R Soc Sci Varsovie, 30 (1937), 31-38.
24. M. Molloy and B. Reed, Further algorithmic aspects of the Local Lemma, Proceedings of the Thirtieth ACM Symposium on Theory of Computing, 1998, pp. 524-529.
25. J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, SIAM J Comput, 22(4) (1993), 838-856.
26. J. H. Spencer, Coloring n-sets red and blue, J Combinatorial Theory, Series A, 30 (1981), 112-113.
27. J. H. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987. (Second edition published in 1994.)
28. Z. Szabó, An application of Lovász' local lemma - a new lower bound for the van der Waerden number, Random Structures Algorithms, 1 (1990), 343-360.
29. C. Thomassen, The even cycle problem for directed graphs, J Amer Math Soc, 5 (1992), 217-229.