2000 character limit reached
The Regularity Lemma with bounded VC Dimension (1304.5951v2)
Published 22 Apr 2013 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.