A tight lower bound for Szemerédi's regularity lemma
From MaRDI portal
Publication:1714948
DOI10.1007/s00493-016-3274-4zbMath1413.05316arXiv1403.1768OpenAlexW2401939847WikidataQ124799171 ScholiaQ124799171MaRDI QIDQ1714948
László Miklós Lovász, Jacob Fox
Publication date: 1 February 2019
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.1768
Related Items
Tower-type bounds for Roth's theorem with popular differences, A unified view of graph regularity via matrix decompositions, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Some Cubic Time Regularity Algorithms for Triple Systems, Local-vs-global combinatorics, On Regularity Lemmas and their Algorithmic Applications, Regular partitions of gentle graphs, Limitations on regularity lemmas for clustering graphs, Regularity lemmas for clustering graphs, Quantitative structure of stable sets in arbitrary finite groups, A tight bound for hypergraph regularity
