A tight bound for hypergraph regularity
From MaRDI portal
Publication:2334614
DOI10.1007/s00039-019-00512-5zbMath1426.05120arXiv1804.05511OpenAlexW2969539104WikidataQ127348414 ScholiaQ127348414MaRDI QIDQ2334614
Publication date: 7 November 2019
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.05511
Related Items
A blurred view of Van der Waerden type theorems ⋮ Hypergraph regularity and random sampling ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ Local-vs-global combinatorics ⋮ A tight bound for hypergraph regularity
Cites Work
- Embedding tetrahedra into quasirandom hypergraphs
- A measure-theoretic approach to the theory of dense hypergraphs
- A new proof of the graph removal lemma
- A short proof of Gowers' lower bound for the regularity lemma
- A variant of the hypergraph removal lemma
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- An ergodic Szemerédi theorem for commuting transformations
- Lower bounds of tower type for Szemerédi's uniformity lemma
- A tight lower bound for Szemerédi's regularity lemma
- Bounds for graph regularity and removal lemmas
- A tight bound for hypergraph regularity
- Density theorems and extremal hypergraph problems
- Hypergraph regularity and the multidimensional Szemerédi theorem
- σ-algebras for quasirandom hypergraphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Primitive Recursive Bounds for Van Der Waerden Numbers
- On sets of integers containing k elements in arithmetic progression
- Extremal problems on set systems
- A sparse regular approximation lemma
- Regularity Lemma for k-uniform hypergraphs
- A Note on a Question of Erdős and Graham
- A Wowzer-type lower bound for the strong regularity lemma
- Probability Inequalities for Sums of Bounded Random Variables
- The hypergraph regularity method and its applications
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- On Certain Sets of Integers (II)
- Quasi-random graphs
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
