The hypergraph regularity method and its applications
From MaRDI portal
Publication:5385859
DOI10.1073/PNAS.0502771102zbMath1135.05307OpenAlexW2143456215WikidataQ33852185 ScholiaQ33852185MaRDI QIDQ5385859
Jozef Skokan, Yoshiharu Kohayakawa, Mathias Schacht, Vojtěch Rödl, Brendan Nagle
Publication date: 7 May 2008
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.0502771102
Related Items (12)
Testing Linear-Invariant Properties ⋮ Diagonal Ramsey via effective quasirandomness ⋮ Extremal independent set reconfiguration ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ Regularity, uniformity, and quasirandomness ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Keisler's order is not simple (and simple theories may not be either) ⋮ Reconstruction of Kauffman networks applying trees ⋮ Generalizations of the removal lemma ⋮ Hereditary properties of hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ A tight bound for hypergraph regularity
Cites Work
- Quick approximation to matrices and applications
- An ergodic Szemerédi theorem for commuting transformations
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Hypergraphs, quasi-randomness, and conditions for regularity
- A density version of the Hales-Jewett theorem
- Pseudo-random hypergraphs
- Quasi-random hypergraphs
- Quasi‐random classes of hypergraphs
- Regularity properties for triple systems
- An Algorithmic Regularity Lemma for Hypergraphs
- Extremal problems on set systems
- A Note on a Question of Erdős and Graham
- Quasi-random hypergraphs
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- The asymptotic number of triple systems not containing a fixed one
- A new proof of Szemerédi's theorem
This page was built for publication: The hypergraph regularity method and its applications
