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)- The number of 3-SAT functions
- Hypergraph removal lemmas via robust sharp threshold theorems
- Colouring versus density in integers and Hales-Jewett cubes
- Ramsey numbers of sparse hypergraphs
- An approximate version of Sidorenko's conjecture
- Extremal results in sparse pseudorandom graphs
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Lower bound on the size of a quasirandom forcing set of permutations
- Green's conjecture and testing linear invariant properties
- Uniformity norms, their weaker versions, and applications
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Equivalent regular partitions of three-uniform hypergraphs
- Szemerédi's regularity lemma via martingales
- The (7, 4)-Conjecture in Finite Groups
- Hypergraph based Berge hypergraphs
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- From harmonic analysis to arithmetic combinatorics
- Induced Turán problem in bipartite graphs
- A combinatorial proof of the removal lemma for groups
- The NOF multiparty communication complexity of composed functions
- On the KŁR conjecture in random graphs
- A hypergraph regularity method for generalized Turán problems
- An analytic approach to sparse hypergraphs: hypergraph removal
- Patterns without a popular difference
- The quasi-randomness of hypergraph cut properties
- The Gaussian primes contain arbitrarily shaped constellations
- Bounding the number of hyperedges in friendship \(r\)-hypergraphs
- Interview with Larry Guth
- Saturating Sperner families
- A removal lemma for systems of linear equations over finite fields
- A new bound for the Brown-Erdős-Sós problem
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- A hypergraph blow-up lemma
- Quasirandom Latin squares
- Weak quasi-randomness for uniform hypergraphs
- Generalizations of Fourier analysis, and how to apply them
- Weak hypergraph regularity and applications to geometric Ramsey theory
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
- Concentration estimates for functions of finite high‐dimensional random arrays
- Szemerédi's theorem, frequent hypercyclicity and multiple recurrence
- An arithmetic transference proof of a relative Szemerédi theorem
- Turán number of generalized triangles
- F$F$‐factors in Quasi‐random Hypergraphs
- Note on the 3-graph counting Lemma
- Tight cycles and regular slices in dense hypergraphs
- Mixing for progressions in nonabelian groups.
- Szemerédi's proof of Szemerédi's theorem
- Sparse hypergraphs: new bounds and constructions
- On arithmetic progressions in symmetric sets in finite field model
- Additive combinatorics and graph theory
- Diagonal Ramsey via effective quasirandomness
- Quasirandom permutations are characterized by 4-point densities
- 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
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)
