What is the furthest graph from a hereditary property?
From MaRDI portal
Publication:3522831
DOI10.1002/rsa.20209zbMath1146.05046MaRDI QIDQ3522831
Publication date: 4 September 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20209
random graphs; maximal distance; edit distance; edge removal; monotone graph property; hereditary graph properties; vertex removal; regularity Lemma; Szemeredi regularity lemma; algorithmis edge-modification problems; edge modifications
Related Items
On the edit distance function of the random graph, Largest subgraph from a hereditary property in a random graph, The edit distance function and symmetrization, On the computation of edit distance functions, Testing properties of graphs and functions, The structure of hereditary properties and 2-coloured multigraphs, The maximum edit distance from hereditary graph properties, Hardness of edge-modification problems, Accumulation points of the edit distance function, The edit distance function of some graphs, On the edit distance of powers of cycles, On the Edit Distance from K2,t-Free Graphs, Partitioning a Graph into Highly Connected Subgraphs, Edit distance measure for graphs, Stability‐type results for hereditary properties
Cites Work
