A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least en 2 edges have to be deleted from it to make it H-free. We show that in this case G contains at least f ðe; HÞn h copies of H: This is proved by establishing a directed version of Szemere´di's regularity lemma, and implies that for every H there is a one-sided error property tester whose query complexity is bounded by a function of e only for testing the property P H of beingdoi:10.1145/780542.780644 dblp:conf/stoc/AlonS03 fatcat:yygqqngfdne2pktkac7b3wm22q