Hypergraph regularity and the multidimensional Szemerédi theorem
From MaRDI portal
Publication:2482877
Abstract: We prove analogues for hypergraphs of Szemer'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer'edi theorem of Furstenberg and Katznelson, and the first proof that provides an explicit bound. Similar results with the same consequences have been obtained independently by Nagle, R"odl, Schacht and Skokan.
Recommendations
Cited in
(only showing first 100 items - show all)- On random sampling in uniform hypergraphs
- Constructive packings by linear hypergraphs
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Testing Linear-Invariant Properties
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- Extremal independent set reconfiguration
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- No additional tournaments are quasirandom-forcing
- Proof of the Brown-Erdős-Sós conjecture in groups
- Hypergraph regularity and random sampling
- Regular partitions of gentle graphs
- On 3‐graphs with no four vertices spanning exactly two edges
- On the Chromatic Thresholds of Hypergraphs
- Multiple recurrence in quasirandom groups
- On graph norms for complex‐valued functions
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- On replica symmetry of large deviations in random graphs
- Finite order spreading models
- Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma
- Finite reflection groups and graph norms
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Dirac-type theorems in random hypergraphs
- Testability and repair of hereditary hypergraph properties
- Sparse partition universal graphs for graphs of bounded degree
- Combinatorial theorems in sparse random sets
- Subsets of without L-shaped configurations
- Hypergraph limits: A regularity approach
- Independent sets in hypergraphs
- Graph norms and Sidorenko's conjecture
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- The poset of hypergraph quasirandomness
- A measure-theoretic approach to the theory of dense hypergraphs
- Quasi-random Boolean functions
- An approximate logic for measures
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Generalizations of the removal lemma
- A geometric theory for hypergraph matching
- Characterization of quasirandom permutations by a pattern sum
- Ramsey classes of topological and metric spaces
- Sum-avoiding sets in groups
- Improved monochromatic loose cycle partitions in hypergraphs
- Cut distance identifying graphon parameters over weak* limits
- Keisler's order is not simple (and simple theories may not be either)
- Hereditary properties of hypergraphs
- Corners over quasirandom groups
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- Density and regularity theorems for semi-algebraic hypergraphs
- On the algebraic and topological structure of the set of Turán densities
- Hypergraph Independent Sets
- Random Simplicial Complexes: Models and Phenomena
- Testing Linear-Invariant Non-linear Properties: A Short Report
- Weak hypergraph regularity and linear hypergraphs
- scientific article; zbMATH DE number 7415089 (Why is no real title available?)
- Quasirandom-Forcing Orientations of Cycles
- Gowers uniformity norm and pseudorandom measures of the pseudorandom binary sequences
- Testable and untestable classes of first-order formulae
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Turán number of bipartite graphs with no \(K_{t,t}\)
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
- Density theorems and extremal hypergraph problems
- A blurred view of Van der Waerden type theorems
- Edge distribution and density in the characteristic sequence
- A tight bound for hypergraph regularity
- Resilience for tight Hamiltonicity
- σ-algebras for quasirandom hypergraphs
- Tournament quasirandomness from local counting
- A new proof of the density Hales-Jewett theorem
- A density version of the Carlson-Simpson theorem
- Counting substructures. II: Hypergraphs
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Eigenvalues and linear quasirandom hypergraphs
- Regular slices for hypergraphs
- Online containers for hypergraphs, with applications to linear equations
- The number of k-dimensional corner-free subsets of grids
- Analytic methods for uniform hypergraphs
- A multidimensional Szemerédi theorem in the primes via combinatorics
- Removal lemmas and approximate homomorphisms
- Roth-type theorems in finite groups
- Some Cubic Time Regularity Algorithms for Triple Systems
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- A relative Szemerédi theorem
- On some extremal results for order types
- Minimum degree conditions for tight Hamilton cycles
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- On the Gowers norms of certain functions
- A sparse regular approximation lemma
- The hypergraph regularity method and its applications
- Erdős-Hajnal-type theorems in hypergraphs
- A variant of the hypergraph removal lemma
- Loose Hamilton cycles in hypergraphs
- A new proof of the graph removal lemma
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Hypergraphs without exponents
- Local-vs-global combinatorics
- Restricted problems in extremal combinatorics
- An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension
- Forcing generalised quasirandom graphs efficiently
- On the threshold for Szemerédi's theorem with random differences
This page was built for publication: Hypergraph regularity and the multidimensional Szemerédi theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482877)
