Density theorems and extremal hypergraph problems (Q2382340): Difference between revisions

The goal of this clearly written, nice paper is to give new, qualitative proofs for the density versions of some combinatorial partition theorems by Szemerédi, Furstenberg and Katznelson. The main tool of the investigation is the so-called removal lemma, proved by Gowers and, independently, by Nagle, Rödl, Schacht and Sokan.