The Lovász Local Lemma and Its Applications to some Combinatorial Arrays

Abstract

The Lovasz Local Lemma is a useful tool in the “probabilistic method” that has found many applications in combinatorics. In this paper, we discuss applications of the Lovasz Local Lemma to some combinatorial set systems and arrays, including perfect hash families, separating hash families, u-free systems, splitting systems, and generalized cover-free families. We obtain improved bounds for some of these set sytems. Also, we compare some of the bounds obtained from the local lemma to those using the basic probabilistic method as well as the well-known “expurgation” method. Finally, we briefly consider a “high probability” variation of the method, wherein a desired object is obtained with high probability in a suitable space.