An introduction to the probabilistic method through the Lov\'asz Local Lemma

TL;DR

This paper introduces the probabilistic method, especially the Lovász Local Lemma, demonstrating its use in proving existence results in combinatorics with applications in hypergraph packing and Latin transversals.

Contribution

It provides an accessible introduction to the Lovász Local Lemma and showcases its applications in combinatorial problems, emphasizing the probabilistic approach.

Findings

The Lovász Local Lemma offers a lower bound for avoiding certain events.

Applications include hypergraph packing problems.

The lemma is useful for establishing existence in combinatorics.

Abstract

We illustrate the use of probability theory in existential proofs, focusing on the Lov\'asz Local Lemma. This result gives a lower bound for the probability of avoiding a suitable finite collection of events. We describe some applications of this result in hypergraph packing and Latin transversals.