A variant of the hypergraph removal lemma
From MaRDI portal
Publication:855826
DOI10.1016/J.JCTA.2005.11.006zbMATH Open1105.05052arXivmath/0503572OpenAlexW2058870462WikidataQ56341570 ScholiaQ56341570MaRDI QIDQ855826FDOQ855826
Authors: Terence Tao 
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/math/0503572
Recommendations
- The Gaussian primes contain arbitrarily shaped constellations
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Graph removal lemmas
- Density theorems and extremal hypergraph problems
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Other combinatorial number theory (11B75)
Cites Work
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regularity Lemma for k-uniform hypergraphs
- Title not available (Why is that?)
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A new proof of Szemerédi's theorem
- An ergodic Szemerédi theorem for commuting transformations
- The primes contain arbitrarily long arithmetic progressions
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The uniformity lemma for hypergraphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Title not available (Why is that?)
- Extremal problems on set systems
- Regular Partitions of Hypergraphs: Counting Lemmas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Density theorems and extremal hypergraph problems
- On a problem of Gowers
- A Note on a Question of Erdős and Graham
- Regularity lemmas for hypergraphs and quasi-randomness
- The Gaussian primes contain arbitrarily shaped constellations
- On a question of Gowers
- Title not available (Why is that?)
Cited In (67)
- Estimating parameters associated with monotone properties
- Corners over quasirandom groups
- Schur's colouring theorem for noncommuting pairs
- Polynomial removal lemma for ordered matchings
- Local-vs-global combinatorics
- Hypergraph regularity and random sampling
- On the Ramsey number of sparse 3-graphs
- On the Chromatic Thresholds of Hypergraphs
- Multiple recurrence in quasirandom groups
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Subsets of without L-shaped configurations
- Hypergraph limits: A regularity approach
- The poset of hypergraph quasirandomness
- Combinatorial theorems in sparse random sets
- A measure-theoretic approach to the theory of dense hypergraphs
- Generalizations of the removal lemma
- Sum-avoiding sets in groups
- Keisler's order is not simple (and simple theories may not be either)
- Hereditary properties of hypergraphs
- The primes contain arbitrarily long polynomial progressions
- Hypergraph Independent Sets
- On \(k\)-uniform random hypergraphs without generalized fans
- Weak hypergraph regularity and linear hypergraphs
- Testable and untestable classes of first-order formulae
- Induced arithmetic removal: complexity 1 patterns over finite fields
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- The removal lemma for tournaments
- A tight bound for hypergraph regularity
- σ-algebras for quasirandom hypergraphs
- Linear equations in primes
- Counting substructures. II: Hypergraphs
- Removal lemmas and approximate homomorphisms
- Online containers for hypergraphs, with applications to linear equations
- A multidimensional Szemerédi theorem in the primes via combinatorics
- A sparse regular approximation lemma
- A relative Szemerédi theorem
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
- A new proof of the graph removal lemma
- A removal lemma for linear configurations in subsets of the circle
- Hypergraph removal lemmas via robust sharp threshold theorems
- Green's conjecture and testing linear invariant properties
- Extremal results in sparse pseudorandom graphs
- From harmonic analysis to arithmetic combinatorics
- Efficient removal lemmas for matrices
- Szemerédi's regularity lemma via martingales
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- Stability results for random discrete structures
- A combinatorial proof of the removal lemma for groups
- A hypergraph regularity method for generalized Turán problems
- An analytic approach to sparse hypergraphs: hypergraph removal
- On the KŁR conjecture in random graphs
- The quasi-randomness of hypergraph cut properties
- Efficient removal lemmas for matrices
- The Gaussian primes contain arbitrarily shaped constellations
- A removal lemma for systems of linear equations over finite fields
- A new bound for the Brown-Erdős-Sós problem
- The symmetry preserving removal Lemma
- Norm convergence of multiple ergodic averages for commuting transformations
- A hypergraph blow-up lemma
- Weak hypergraph regularity and applications to geometric Ramsey theory
- Generalizations of Fourier analysis, and how to apply them
- An arithmetic transference proof of a relative Szemerédi theorem
- Mixing for progressions in nonabelian groups.
- An exact Turán result for the generalized triangle
- Additive combinatorics and graph theory
This page was built for publication: A variant of the hypergraph removal lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855826)
