Excluding induced subgraphs II: extremal graphs
Discrete Applied Mathematics
On the size of hereditary classes of graphs
Journal of Combinatorial Theory Series B
Handbook of combinatorics (vol. 2)
Generalized chromatic numbers of random graphs
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
The speed of hereditary properties of graphs
Journal of Combinatorial Theory Series B
The penultimate rate of growth for graph properties
European Journal of Combinatorics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Avoiding Patterns in Matrices Via a Small Number of Changes
SIAM Journal on Discrete Mathematics
On the editing distance of graphs
Journal of Graph Theory
What is the furthest graph from a hereditary property?
Random Structures & Algorithms
What is the furthest graph from a hereditary property?
Random Structures & Algorithms
Hardness of edge-modification problems
Theoretical Computer Science
Hi-index | 0.00 |
For a graph property P, the edit distance of a graph G from P, denoted E"P(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the largest possible edit distance of a graph on n vertices from P? Denote this distance by ed(n,P). A graph property is hereditary if it is closed under removal of vertices. In a previous work, the authors show that for any hereditary property, a random graph G(n,p(P)) essentially achieves the maximal distance from P, proving: ed(n,P)=E"P(G(n,p(P)))+o(n^2) with high probability. The proof implicitly asserts the existence of such p(P), but it does not supply a general tool for determining its value or the edit distance. In this paper, we determine the values of p(P) and ed(n,P) for some subfamilies of hereditary properties including sparse hereditary properties, complement invariant properties, (r,s)-colorability and more. We provide methods for analyzing the maximum edit distance from the graph properties of being induced H-free for some graphs H, and use it to show that in some natural cases G(n,1/2) is not the furthest graph. Throughout the paper, the various tools let us deduce the asymptotic maximum edit distance from some well studied hereditary graph properties, such as being Perfect, Chordal, Interval, Permutation, Claw-Free, Cograph and more. We also determine the edit distance of G(n,1/2) from any hereditary property, and investigate the behavior of E"P(G(n,p)) as a function of p. The proofs combine several tools in Extremal Graph Theory, including strengthened versions of the Szemeredi Regularity Lemma, Ramsey Theory and properties of random graphs.