Limitations on regularity lemmas for clustering graphs

Noga Alon, Guy Moshkovitz*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Szemerédi's regularity lemma is one instance in a family of regularity lemmas, replacing the definition of density of a graph by a more general coefficient. Recently, Fan Chung proved another instance, a regularity lemma for clustering graphs, and asked whether good upper bounds could be derived for the quantitative estimates it supplies. We answer this question in the negative, for every generalized regularity lemma.

Original languageEnglish
Article number102135
JournalAdvances in Applied Mathematics
StatePublished - Mar 2021


FundersFunder number
National Science FoundationDMS-1855464, 1855464
Bonfils-Stanton Foundation2018267, CCF-1412958, CCF-1445755
Israel Science Foundation281/17


    Dive into the research topics of 'Limitations on regularity lemmas for clustering graphs'. Together they form a unique fingerprint.

    Cite this