SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Journal of Algorithms
A characterization of easily testable induced subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Linear equations, arithmetic progressions and hypergraph property testing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least \varepsilonn2 edges have to be deleted from it to make it H-free. It is known that in this case G contains at least f(\varepsilon, H)nh copies of H. We show that the largest possible function f(\varepsilon, H) is polynomial in \varepsilon if and only if H is bipartite. This implies that there is a one-sided error property tester for checking H-freeness, whose query complexity is polynomial in 1 = \varepsilon, if and only if H is bipartite.