## Szemerédi’s regularity lemma revisited

Venue: | Contrib. Discrete Math |

Citations: | 14 - 3 self |

### BibTeX

@ARTICLE{Tao_szemerédi’sregularity,

author = {Terence Tao},

title = {Szemerédi’s regularity lemma revisited},

journal = {Contrib. Discrete Math},

year = {},

pages = {2006}

}

### OpenURL

### Abstract

Abstract. Szemerédi’s regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemerédi’s theorem on arithmetic progressions [19], [18]. In this note we revisit this lemma from the perspective of probability theory and information theory instead of graph theory, and observe a slightly stronger variant of this lemma, related to similar strengthenings of that lemma in [1]. This stronger version of the regularity lemma was extended in [21] to reprove the analogous regularity lemma for hypergraphs. 1.