Papers
Topics
Authors
Recent
Search
2000 character limit reached

A tight lower bound for Szemerédi's regularity lemma

Published 7 Mar 2014 in math.CO and cs.DM | (1403.1768v1)

Abstract: Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemer\'edi's regularity lemma.

Citations (35)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up