A variant of the hypergraph removal lemma
| dc.creator | Tao, Terence | |
| dc.date | 2005-03-24 | |
| dc.date | 2005-11-16 | |
| dc.date.accessioned | 2026-07-07T06:39:39Z | |
| dc.date.available | 2026-07-07T06:39:39Z | |
| dc.description | Recent work of Gowers and Nagle, Rödl, Schacht, and Skokan has established a hypergraph removal lemma, which in turn implies some results of Szemerédi and Furstenberg-Katznelson concerning one-dimensional and multi-dimensional arithmetic progressions respectively. In this paper we shall give a self-contained proof of this hypergraph removal lemma. In fact we prove a slight strengthening of the result, which we will use in a subsequent paper to establish infinitely many constellations of a prescribed shape in the Gaussian primes. | |
| dc.description | 25 pages, no figures, to appear, J. Combin. Thy A. This is the final version, incorporating the referee's comments | |
| dc.identifier | https://arxiv.org/abs/math/0503572 | |
| dc.identifier | http://arxiv.org/abs/math/0503572 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/101157 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C65 | |
| dc.title | A variant of the hypergraph removal lemma | |
| dc.type | text |