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)- Cut distance identifying graphon parameters over weak* limits
- Keisler's order is not simple (and simple theories may not be either)
- Hypergraph based Berge hypergraphs
- On the Gowers norms of certain functions
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
- A multidimensional Szemerédi theorem in the primes via combinatorics
- On arithmetic progressions in symmetric sets in finite field model
- Lower bound on the size of a quasirandom forcing set of permutations
- Characterization of quasirandom permutations by a pattern sum
- Constructive packings by linear hypergraphs
- Tournament quasirandomness from local counting
- The Gaussian primes contain arbitrarily shaped constellations
- On 3‐graphs with no four vertices spanning exactly two edges
- Density and regularity theorems for semi-algebraic hypergraphs
- A new bound for the Brown-Erdős-Sós problem
- Gowers uniformity norm and pseudorandom measures of the pseudorandom binary sequences
- Testing Linear-Invariant Non-linear Properties: A Short Report
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Removal lemmas and approximate homomorphisms
- An arithmetic transference proof of a relative Szemerédi theorem
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Diagonal Ramsey via effective quasirandomness
- Concentration estimates for functions of finite high‐dimensional random arrays
- The number of \(k\)-dimensional corner-free subsets of grids
- Additive combinatorics and graph theory
- Arithmetic progressions, different regularity lemmas and removal lemmas
- F$F$‐factors in Quasi‐random Hypergraphs
- Green's conjecture and testing linear invariant properties
- Proof of the Brown-Erdős-Sós conjecture in groups
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Note on the 3-graph counting Lemma
- Finite reflection groups and graph norms
- Mixing for progressions in nonabelian groups.
- Uniformity norms, their weaker versions, and applications
- Ramsey classes of topological and metric spaces
- A sparse regular approximation lemma
- Random Simplicial Complexes: Models and Phenomena
- An analytic approach to sparse hypergraphs: hypergraph removal
- Szemerédi's proof of Szemerédi's theorem
- Testing Linear-Invariant Properties
- Weak hypergraph regularity and applications to geometric Ramsey theory
- Hypergraph removal lemmas via robust sharp threshold theorems
- The number of 3-SAT functions
- Regular partitions of gentle graphs
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
- Dirac-type theorems in random hypergraphs
- Subsets of without L-shaped configurations
- Generalizations of Fourier analysis, and how to apply them
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- No additional tournaments are quasirandom-forcing
- Hypergraphs without exponents
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- A new proof of the graph removal lemma
- Szemerédi's regularity lemma via martingales
- The NOF multiparty communication complexity of composed functions
- Weak hypergraph regularity and linear hypergraphs
- Testable and untestable classes of first-order formulae
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
- Edge distribution and density in the characteristic sequence
- Improved monochromatic loose cycle partitions in hypergraphs
- On the KŁR conjecture in random graphs
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- Counting substructures. II: Hypergraphs
- A removal lemma for systems of linear equations over finite fields
- Quasirandom permutations are characterized by 4-point densities
- Minimum degree conditions for tight Hamilton cycles
- Graph norms and Sidorenko's conjecture
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- On the Chromatic Thresholds of Hypergraphs
- Independent sets in hypergraphs
- Quasirandom Latin squares
- On the algebraic and topological structure of the set of Turán densities
- Hereditary properties of hypergraphs
- Saturating Sperner families
- The (7, 4)-Conjecture in Finite Groups
- Hypergraph limits: A regularity approach
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- The poset of hypergraph quasirandomness
- An approximate logic for measures
- On replica symmetry of large deviations in random graphs
- Hypergraph Independent Sets
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- A combinatorial proof of the removal lemma for groups
- Turán number of generalized triangles
- A measure-theoretic approach to the theory of dense hypergraphs
- Erdős-Hajnal-type theorems in hypergraphs
- Extremal results in sparse pseudorandom graphs
- A variant of the hypergraph removal lemma
- Sum-avoiding sets in groups
- A new proof of the density Hales-Jewett theorem
- The hypergraph regularity method and its applications
- Analytic methods for uniform hypergraphs
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- A hypergraph regularity method for generalized Turán problems
- Turán number of bipartite graphs with no \(K_{t,t}\)
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)
