Szemer\'edi's regularity lemma via martingales
classification
🧮 math.CO
math.FAmath.PR
keywords
lemmaregularityszemerabstractappliesapproachdifferencegraphons
read the original abstract
We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random variables in $L_p$ for any $p>1$. Our approach is based on martingale difference sequences.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.