Hypergraph colouring and the Lovász Local Lemma

Discrete Mathematics

Volumn 167-168, Issue , 1997, Pages 481-486

  McDiarmid, Colin ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001448982     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00249-X     Document Type: Article

References (12)

1. N. Alon, A parallel algorithmic version of the local lemma, Random Structures and Algorithms 2 (1991) 367-378.
2. N. Alon and Z. Bregman, Every 8-uniform 8-regular hypergraph is 2-colourable, Graphs Combin. 4 (1988) 303-305.
3. N. Alon and J.H. Spencer, The Probabilistic Method (Wiley, New York, 1992).
4. J. Beck, An algorithmic approach to the Lovász local lemma I, Random Structures and Algorithms 2 (1991) 343-365.
5. B. Bollobás, Random Graphs (Academic Press, New York, 1985).
6. P. Erdos and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in: A. Hajnal et al., eds., Infinite and Finite Sets (North-Holland, Amsterdam, 1975) 609-628.
7. P. Erdos and J.H. Spencer, Lopsided Lovász local lemma and latin transversals, Discrete Appl. Math. 30 (1991) 151-154.
8. R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory, 2nd ed., (Wiley, New York, 1990).
9. T.E. Harris, A lower bound for the critical probability in a certain percolation process, Math. Proc. Cambridge Philos. Soc. 56 (1960) 13-20.
10. P.D. Seymour, On the two colouring of hypergraphs, Quart. J. Math. Oxford Series 3, 25 (1974) 303-312.
11. J.H. Spencer, The probabilistic method, Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms (1992) 41-47.
12. C. Thomassen, The even cycle problem for directed graphs, J. Amer. Math. Soc. 5 (1992) 217-229.