Hypergraph regularity and the multidimensional Szemerédi theorem
From MaRDI portal
Publication:2482877
DOI10.4007/annals.2007.166.897zbMath1159.05052arXiv0710.3032OpenAlexW2149054878WikidataQ55881476 ScholiaQ55881476MaRDI QIDQ2482877
Publication date: 25 April 2008
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.3032
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) General groups of measure-preserving transformations (28D15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (only showing first 100 items - show all)
Cut distance identifying graphon parameters over weak* limits ⋮ Finite reflection groups and graph norms ⋮ Additive combinatorics and graph theory ⋮ Dirac-type theorems in random hypergraphs ⋮ GOWERS UNIFORMITY NORM AND PSEUDORANDOM MEASURES OF THE PSEUDORANDOM BINARY SEQUENCES ⋮ Quasirandom permutations are characterized by 4-point densities ⋮ Random Simplicial Complexes: Models and Phenomena ⋮ Interview with Larry Guth ⋮ Szemerédi's regularity lemma via martingales ⋮ Generalizations of Fourier analysis, and how to apply them ⋮ Density theorems and extremal hypergraph problems ⋮ Regular slices for hypergraphs ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ The number of \(k\)-dimensional corner-free subsets of grids ⋮ A variant of the hypergraph removal lemma ⋮ Weak hypergraph regularity and applications to geometric Ramsey theory ⋮ On replica symmetry of large deviations in random graphs ⋮ Hypergraph limits: A regularity approach ⋮ Turán number of generalized triangles ⋮ Combinatorial theorems in sparse random sets ⋮ Saturating Sperner families ⋮ Uniformity norms, their weaker versions, and applications ⋮ Patterns without a popular difference ⋮ Testing Linear-Invariant Properties ⋮ On the Gowers norms of certain functions ⋮ An approximate version of Sidorenko's conjecture ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ σ-algebras for quasirandom hypergraphs ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Finite order spreading models ⋮ The number of 3-SAT functions ⋮ A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing ⋮ Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma ⋮ Loose Hamilton cycles in hypergraphs ⋮ On arithmetic progressions in symmetric sets in finite field model ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ A new proof of the density Hales-Jewett theorem ⋮ Ramsey classes of topological and metric spaces ⋮ Edge distribution and density in the characteristic sequence ⋮ Exact minimum degree thresholds for perfect matchings in uniform hypergraphs ⋮ Testable and untestable classes of first-order formulae ⋮ A new proof of the graph removal lemma ⋮ A multidimensional Szemerédi theorem in the primes via combinatorics ⋮ Extremal results in sparse pseudorandom graphs ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs ⋮ Regular partitions of gentle graphs ⋮ Szemerédi's proof of Szemerédi's theorem ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Multiple recurrence in quasirandom groups ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A density version of the Carlson-Simpson theorem ⋮ A sparse regular approximation lemma ⋮ Counting substructures. II: Hypergraphs ⋮ Note on the 3-graph counting Lemma ⋮ The NOF multiparty communication complexity of composed functions ⋮ Bounding the number of hyperedges in friendship \(r\)-hypergraphs ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Keisler's order is not simple (and simple theories may not be either) ⋮ Hypergraph Independent Sets ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Analytic methods for uniform hypergraphs ⋮ Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs ⋮ The Gaussian primes contain arbitrarily shaped constellations ⋮ A removal lemma for systems of linear equations over finite fields ⋮ Weak hypergraph regularity and linear hypergraphs ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Green’s Conjecture and Testing Linear Invariant Properties ⋮ An approximate logic for measures ⋮ Erdős-Hajnal-type theorems in hypergraphs ⋮ Hamilton \(\ell \)-cycles in uniform hypergraphs ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Generalizations of the removal lemma ⋮ The effect of induced subgraphs on quasi-randomness ⋮ Testability and repair of hereditary hypergraph properties ⋮ A hypergraph regularity method for generalized Turán problems ⋮ Roth-type theorems in finite groups ⋮ Tournament quasirandomness from local counting ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ Proof of the Brown–Erdős–Sós conjecture in groups ⋮ Hereditary properties of hypergraphs ⋮ Hypergraphs without exponents ⋮ Arithmetic progressions, different regularity lemmas and removal lemmas ⋮ Characterization of quasirandom permutations by a pattern sum ⋮ A combinatorial proof of the removal lemma for groups ⋮ A hypergraph blow-up lemma ⋮ Sum-avoiding sets in groups ⋮ Hypergraph based Berge hypergraphs ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Weak quasi-randomness for uniform hypergraphs ⋮ The quasi-randomness of hypergraph cut properties ⋮ MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS ⋮ A tight bound for hypergraph regularity ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ No additional tournaments are quasirandom-forcing ⋮ On the algebraic and topological structure of the set of Turán densities ⋮ A relative Szemerédi theorem
This page was built for publication: Hypergraph regularity and the multidimensional Szemerédi theorem
