Abstract
As we have seen, the Local Lemma allows us to use a local analysis to obtain a global result. From this perspective, a drawback of the version presented in Chap. 4 is that it requires global bounds p and d. These global bounds can make it difficult to apply the Local Lemma if, for example, the probabilities of the bad events vary widely. In this chapter we will discuss a few useful generalizations of the Local Lemma, each of which incorporates varying probabilities of the bad events.
This is a preview of subscription content, log in via an institution to check access.
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). Generalizations of the 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_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-04016-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive