The edit distance function and symmetrization

zbMath1298.05174arXiv1007.1897MaRDI QIDQ396842

Ryan R. Martin

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1897

zbMATH Keywords

quadratic programmingsymmetrizationcycleshereditary propertiesedit distancecolored regularity graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Accumulation points of the edit distance function ⋮ On the Edit Distance from K2,t-Free Graphs ⋮ The edit distance function of some graphs ⋮ On the computation of edit distance functions ⋮ On the edit distance of powers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Excluding induced subgraphs. II: Extremal graphs
• The maximum edit distance from hereditary graph properties
• An exact Turán result for the generalized triangle
• Edit distance and its computation
• Hardness of edge-modification problems
• Boundedness of optimal matrices in extremal multigraph and digraph problems
• On the editing distance of graphs
• What is the furthest graph from a hereditary property?
• Stability‐type results for hereditary properties
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• On the entropy values of hereditary classes of graphs
• Avoiding Patterns in Matrices Via a Small Number of Changes
• On Graphs that do not Contain a Thomsen Graph
• The structure of hereditary properties and colourings of random graphs

This page was built for publication: The edit distance function and symmetrization