arXiv:1403.1768 Abstract | arXiv Analytics

Published 2014-03-07Version 1

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.

Comments: 31 pages

Categories: math.CO, cs.DM

Keywords: tight lower bound, szemerédis regularity lemma, szemeredis regularity lemma, tower height

Related articles: Most relevant | Search more

arXiv:1010.0628 [math.CO] (Published 2010-10-04, updated 2010-11-08)

Szemerédi's Regularity Lemma for matrices and sparse graphs

Alexander Scott

arXiv:math/0504472 [math.CO] (Published 2005-04-22, updated 2005-11-16)

Szemerédi's regularity lemma revisited

Terence Tao

arXiv:1106.2871 [math.CO] (Published 2011-06-15, updated 2016-05-21)

A version of Szemerédi's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs

arXiv Analytics