A variant of the hypergraph removal lemma
From MaRDI portal
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.
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
Cites work
- A new proof of Szemerédi's theorem
- A Note on a Question of Erdős and Graham
- An ergodic Szemerédi theorem for commuting transformations
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- Applications of the regularity lemma for uniform hypergraphs
- Density theorems and extremal hypergraph problems
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Extremal problems on set systems
- scientific article; zbMATH DE number 66615 (Why is no real title available?)
- scientific article; zbMATH DE number 3473781 (Why is no real title available?)
- scientific article; zbMATH DE number 3523693 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 2209746 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Lower bounds of tower type for Szemerédi's uniformity lemma
- On a problem of Gowers
- On a question of Gowers
- Regular Partitions of Hypergraphs: Counting Lemmas
- Regularity Lemma for k-uniform hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The counting lemma for regular k‐uniform hypergraphs
- The Gaussian primes contain arbitrarily shaped constellations
- The primes contain arbitrarily long arithmetic progressions
- The uniformity lemma for hypergraphs
Cited in
(79)- Hereditary properties of hypergraphs
- On the Ramsey number of sparse 3-graphs
- A combinatorial proof of the removal lemma for groups
- Additive combinatorics and graph theory
- A multidimensional Szemerédi theorem in the primes via combinatorics
- A removal lemma for systems of linear equations over finite fields
- A new bound for the Brown-Erdős-Sós problem
- Induced arithmetic removal: complexity 1 patterns over finite fields
- Efficient removal lemmas for matrices
- Keisler's order is not simple (and simple theories may not be either)
- On \(k\)-uniform random hypergraphs without generalized fans
- A tight bound for hypergraph regularity
- A relative Szemerédi theorem
- The removal lemma for tournaments
- Extremal results in sparse pseudorandom graphs
- Multiple recurrence in quasirandom groups
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- The Gaussian primes contain arbitrarily shaped constellations
- Sum-avoiding sets in groups
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Mixing for progressions in nonabelian groups.
- σ-algebras for quasirandom hypergraphs
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- A hypergraph blow-up lemma
- Szemerédi's regularity lemma via martingales
- The quasi-randomness of hypergraph cut properties
- Generalizations of Fourier analysis, and how to apply them
- Hypergraph limits: A regularity approach
- Online containers for hypergraphs, with applications to linear equations
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
- Combinatorial theorems in sparse random sets
- A hypergraph regularity method for generalized Turán problems
- Testable and untestable classes of first-order formulae
- A measure-theoretic approach to the theory of dense hypergraphs
- A sparse regular approximation lemma
- An analytic approach to sparse hypergraphs: hypergraph removal
- On the KŁR conjecture in random graphs
- Counting substructures. II: Hypergraphs
- Hypergraph Independent Sets
- Green's conjecture and testing linear invariant properties
- Estimating parameters associated with monotone properties
- Efficient removal lemmas for matrices
- Weak hypergraph regularity and applications to geometric Ramsey theory
- Hypergraph removal lemmas via robust sharp threshold theorems
- The symmetry preserving removal Lemma
- Schur's colouring theorem for noncommuting pairs
- The poset of hypergraph quasirandomness
- On the Chromatic Thresholds of Hypergraphs
- Corners over quasirandom groups
- Norm convergence of multiple ergodic averages for commuting transformations
- A removal lemma for linear configurations in subsets of the circle
- An arithmetic transference proof of a relative Szemerédi theorem
- Stability results for random discrete structures
- From harmonic analysis to arithmetic combinatorics
- Removal lemmas and approximate homomorphisms
- Hypergraph regularity and random sampling
- Subsets of without L-shaped configurations
- Local-vs-global combinatorics
- A new proof of the graph removal lemma
- Polynomial removal lemma for ordered matchings
- The sparse regularity method with Schatten norms and entropy
- Steiner triple systems with high discrepancy
- Some new results on the higher energies
- A characterization of testable hypergraph properties
- A new approach for the Brown-Erdős-Sós problem
- Hypergraph removal with polynomial bounds
- A new approach for the Brown-Erdős-Sós problem (extended abstract)
- Hypergraph anti-Ramsey theorems
- Vlasov equations on directed hypergraph measures
- A removal lemma for ordered hypergraphs
- Spectral algorithms in higher-order Fourier analysis
- Asymmetric results about graph homomorphisms
- The primes contain arbitrarily long polynomial progressions
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- An exact Turán result for the generalized triangle
- Weak hypergraph regularity and linear hypergraphs
- Linear equations in primes
- Generalizations of the removal lemma
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)
