Limitations on regularity lemmas for clustering graphs

DOI10.1016/j.aam.2020.102135zbMath1456.05083OpenAlexW3107148815WikidataQ124852057 ScholiaQ124852057MaRDI QIDQ2221793

Noga Alon, Guy Moshkovitz

Publication date: 2 February 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2020.102135

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• A short proof of Gowers' lower bound for the regularity lemma
• Lower bounds of tower type for Szemerédi's uniformity lemma
• A tight lower bound for Szemerédi's regularity lemma
• Collective dynamics of ‘small-world’ networks
• On Regularity Lemmas and their Algorithmic Applications

This page was built for publication: Limitations on regularity lemmas for clustering graphs