Tolerant Testers for Subgraph-Freeness

Reut Levi, Jonathan Meiri

In this paper we study the problem of tolerantly testing the property of being $H$-free (which also implies distance approximation from being $H$-free). In the general-graphs model…