2015/09/15 by Rogério Gomes Alves, Alves, Rogério G., Aldo Procacci +3
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1509.04638
openalex publication_date 2015/09/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.