A local lemma via entropy compression
Combinatorics
2019-12-12 v3
Abstract
In the framework of the probabilistic method in combinatorics, we revisit the entropy compression method clarifying the setting in which it can be applied and providing a theorem yielding a general constructive criterion. We finally elucidate, through topical examples, the effectiveness of the entropy-compression criterion in comparison with the Lovasz Local Lemma criterion and, in particular, with the improved criterion based on cluster expansion.
Keywords
Cite
@article{arxiv.1509.04638,
title = {A local lemma via entropy compression},
author = {Rogério G. Alves and Aldo Procacci and Remy Sanchis},
journal= {arXiv preprint arXiv:1509.04638},
year = {2019}
}