The effect of two cycles on the complexity of colouring by directed graphs
Discrete Applied Mathematics
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Testing Subgraphs in Large Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Three Theorems Regarding Testing Graph Properties
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Journal of Algorithms
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
Combinatorics, Probability and Computing
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
Packing directed cycles efficiently
Discrete Applied Mathematics
On the Query Complexity of Testing Orientations for Being Eulerian
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Testing whether a digraph contains H-free k-induced subgraphs
Theoretical Computer Science
Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least ε n2 edges have to be deleted from it to make it H-free. We show that in this case G contains at least f(ε,H) nh copies of H. This is proved by establishing a directed version of Szemeredi'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 ε only for testing the property PH of being H-free.