On the query complexity of estimating the distance to hereditary graph properties
share
Given a family of graphs F, we prove that the normalized edit distance of any given graph Γ to being induced F-free is estimable with a query complexity that depends only on the bounds of the Frieze–Kannan Regularity Lemma and on a Removal Lemma for F.
READ FULL TEXT