Abstract
In this chapter, we introduce one of the most powerful tools of the probabilistic method: The Lovász Local Lemma. We present the Local Lemma by reconsidering the problem of 2-colouring a hypergraph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Molloy, M., Reed, B. (2002). The Lovász Local Lemma. In: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04016-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-04016-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive