On the Edit Distance from K2,t-Free Graphs

DOI10.1002/jgt.21777zbMath1302.05045arXiv1012.0800OpenAlexW1831593326MaRDI QIDQ2922222

Tracy McKay, Ryan R. Martin

Publication date: 9 October 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphsedit distancequadratic programing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Quadratic programming (90C20) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (4)

Accumulation points of the edit distance function ⋮ The edit distance function of some graphs ⋮ On the computation of edit distance functions ⋮ On the edit distance of powers of cycles

Cites Work

• The edit distance function and symmetrization
• Edit distance and its computation
• Saturation numbers of books
• New asymptotics for bipartite Turán numbers
• 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?
• On the Structure of Dense Triangle-Free Graphs
• Values of lambda and mu for which there are only finitely many feasible (v,k,lambda,mu)
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: On the Edit Distance from K2,t-Free Graphs