A variant of the hypergraph removal lemma
组合数学
2007-05-23 v2
摘要
Recent work of Gowers and Nagle, R\"odl, Schacht, and Skokan has established a hypergraph removal lemma, which in turn implies some results of Szemer\'edi 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.
引用
@article{arxiv.math/0503572,
title = {A variant of the hypergraph removal lemma},
author = {Terence Tao},
journal= {arXiv preprint arXiv:math/0503572},
year = {2007}
}
备注
25 pages, no figures, to appear, J. Combin. Thy A. This is the final version, incorporating the referee's comments