Density theorems and extremal hypergraph problems
From MaRDI portal
Publication:2382340
DOI10.1007/BF02771992zbMath1127.05055OpenAlexW2049368166MaRDI QIDQ2382340
Norihide Tokushige, Mathias Schacht, Vojtěch Rödl, Eduardo Tengan
Publication date: 9 October 2007
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02771992
Related Items
A variant of the hypergraph removal lemma ⋮ A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma ⋮ Distinct distances and arithmetic progressions ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Generalizations of the removal lemma ⋮ Proof of the Brown–Erdős–Sós conjecture in groups ⋮ The counting lemma for regular k‐uniform hypergraphs ⋮ A tight bound for hypergraph regularity
Cites Work
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- An ergodic Szemerédi theorem for commuting transformations
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A density version of the Hales-Jewett theorem
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Regularity and Positional Games
- On sets of integers containing k elements in arithmetic progression
- Extremal problems on set systems
- Regularity Lemma for k-uniform hypergraphs
- A Note on a Question of Erdős and Graham
- The counting lemma for regular k‐uniform hypergraphs
- A new proof of Szemerédi's theorem
