A Wowzer-type lower bound for the strong regularity lemma

DOI10.1112/plms/pds045zbMath1263.05077arXiv1107.4896OpenAlexW3099333353WikidataQ125032377 ScholiaQ125032377MaRDI QIDQ4920227

Subrahmanyam Kalyanasundaram, Asaf Shapira

Publication date: 16 May 2013

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.4896

zbMATH Keywords

regularity lemmafirst order graph propertytestable property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal combinatorics (05D99)

Related Items (5)

Popular progression differences in vector spaces II ⋮ Testing graphs against an unknown distribution ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ Local-vs-global combinatorics ⋮ A tight bound for hypergraph regularity

This page was built for publication: A Wowzer-type lower bound for the strong regularity lemma