Endre Szemerédi | lemma | lemma (mathematics) | Szemerédi's theorem | König's lemma | Zorn's lemma | the lemma that is not Burnside's | Schur's lemma | Lemma | Johnson–Lindenstrauss lemma | Hotelling's lemma | Fundamental lemma of calculus of variations |
A Simple Algorithm for Constructing Szemerédi's Regularity Partition is a paper by Alan M. Frieze and Ravi Kannan giving an algorithmic version of the Szemerédi regularity lemma to find an ε-regular partition of a given graph.