| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777128 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
Given a family of graphs F, we prove that the distance to being induced F-free is estimable with a query complexity that depends only on the bounds of the Frieze-Kannan Regularity Lemma and a Removal Lemma for F.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni,