Lovasz Local Lemma

The Lovasz Local Lemma gives conditions under which a large collection of mostly independent unwanted events can be avoided simultaneously with positive probability, even in cases where the ordinary union bound is too weak to guarantee this. Named for Laszlo Lovasz, it is a foundational tool of the probabilistic method in combinatorics, used to prove the existence of combinatorial structures that are otherwise hard to construct directly.