  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.
