Removal lemmas with polynomial bounds

DOI10.1145/3055399.3055404zbMath1370.68323arXiv1611.10315WikidataQ124956030 ScholiaQ124956030MaRDI QIDQ4977998

Asaf Shapira, Lior Gishboliner

Publication date: 17 August 2017

Published in: International Mathematics Research Notices, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

removal lemma; graph property testing; polynomially bounded removal lemma

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C35: Extremal problems in graph theory

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms

05C62: Graph representations (geometric and intersection representations, etc.)