@inproceedings{eb4767774c124b86a7e3edb84e7c30ea,
title = "Removal lemmas with polynomial bounds",
abstract = "We give new sufficient and necessary criteria guaranteeing that a hereditary graph property can be tested with a polynomial query complexity. Although both are simple combinatorial criteria, they imply almost all prior positive and negative results of this type, as well as many new ones. One striking application of our results is that every semi-algebraic graph property (e.g., being an interval graph, a unit-disc graph etc.) can be tested with a polynomial query complexity. This confirms a conjecture of Alon. The proofs combine probabilistic ideas together with a novel application of a conditional regularity lemma for matrices, due to Alon, Fischer and Newman.",
keywords = "Graph property testing, Removal lemma",
author = "Lior Gishboliner and Asaf Shapira",
note = "Publisher Copyright: {\textcopyright} 2017 ACM.; 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 ; Conference date: 19-06-2017 Through 23-06-2017",
year = "2017",
month = jun,
day = "19",
doi = "10.1145/3055399.3055404",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "510--522",
editor = "Pierre McKenzie and Valerie King and Hamed Hatami",
booktitle = "STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing",
address = "الولايات المتّحدة",
}