论文信息 - A tight lower bound for Szemerédi’s regularity lemma - 字舞流文

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

We determine the order of the tower height for the partition size in a version of Szemerédi’s regularity lemma. This addresses a question of Gowers.

Jacob Fox | László Miklós Lovász

[1] W. T. Gowers,et al. Lower bounds of tower type for Szemerédi's uniformity lemma , 1997 .

[2] Terence Tao. Szemerédi's regularity lemma revisited , 2006, Contributions Discret. Math..

[3] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[4] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[5] Béla Bollobäs. THE WORK OP WILLIAM TIMOTHY GOWERS , 1998 .

[6] Asaf Shapira,et al. A short proof of Gowers’ lower bound for the regularity lemma , 2016, Comb..

[7] V. Rödl,et al. Regularity Lemmas for Graphs , 2010 .

[8] E. Szemerédi. Regular Partitions of Graphs , 1975 .

[9] N. Alon,et al. The Probabilistic Method: Alon/Probabilistic , 2008 .

[10] David Conlon,et al. Bounds for graph regularity and removal lemmas , 2011, ArXiv.

[11] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[12] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[13] László Lovász,et al. On regularity lemmas and their applications , 2016 .

[14] B. Szegedy,et al. Szemerédi’s Lemma for the Analyst , 2007 .

[15] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[16] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .