Szemerédi's regularity lemma via martingales
From MaRDI portal
Publication:311501
zbMath1344.05076arXiv1410.5966MaRDI QIDQ311501
Vassilis Kanellopoulos, Pandelis Dodos, Thodoris Karageorgos
Publication date: 13 September 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.5966
Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items
Concentration estimates for functions of finite high‐dimensional random arrays, A concentration inequality for product spaces, An Algorithmic Regularity Lemma for $L_p$ Regular Sparse Matrices
Cites Work
- A noncommutative martingale convexity inequality
- A new proof of the density Hales-Jewett theorem
- A density version of the Carlson-Simpson theorem
- A variant of the hypergraph removal lemma
- Szemerédi's lemma for the analyst
- A concentration inequality for product spaces
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quick approximation to matrices and applications
- Sharp uniform convexity and smoothness inequalities for trace norms
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Ramsey Theory for Product Spaces
- A Simple Proof of the Density Hales–Jewett Theorem
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- An Abstract Szemerédi Regularity Lemma
- Primitive Recursive Bounds for Van Der Waerden Numbers
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Probability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
