On Regularity Lemmas and their Algorithmic Applications
On Regularity Lemmas and their Algorithmic Applications
Szemerédi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that the desired vertex partition in the regularity lemma is equitable has a …