The Regularity Lemma with bounded VC Dimension
Combinatorics
2013-04-24 v2
Abstract
We give a proof of Szemeredi's regularity lemma in the special case of a graph with bounded VC dimension and show that it is possible to obtain "merely" doubly exponential bounds on the size of the partition in this case.
Keywords
Cite
@article{arxiv.1304.5951,
title = {The Regularity Lemma with bounded VC Dimension},
author = {Henry Towsner},
journal= {arXiv preprint arXiv:1304.5951},
year = {2013}
}