Alves, Rogério GomesProcacci, AldoSanchis, Remy Paiva2022-03-232022-03-232021ALVES, R. G.; PROCACCI, A.; SANCHIS, R. P. Entropy compression versus Lovász Local Lemma. Advances in Applied Mathematics, v. 125, artigo 102163, 2021. Disponível em: <https://www.sciencedirect.com/science/article/abs/pii/S0196885821000014?via%3Dihub>. Acesso em: 25 ago. 2021.0196-8858http://www.repositorio.ufop.br/jspui/handle/123456789/14719In the framework of the probabilistic method in combinatorics, we provide a systematization of 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 Lovász Local Lemma criterion and, in particular, with the improved criterion based on cluster expansion.en-USrestritoProbabilistic method in combinatoricsRandomized algorithmsArtigo publicado em periodicohttps://www.sciencedirect.com/science/article/abs/pii/S0196885821000014?via%3Dihubhttps://doi.org/10.1016/j.aam.2021.102163