The edit distance function and symmetrization (Q396842): Difference between revisions

Summary: The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The distance between a graph, \(G\), and a hereditary property, \(\mathbb H\), is the minimum of the distance between \(G\) and each \(G^\prime\in \mathbb H\). The edit distance function of \(\mathbb H\) is a function of \(p\in[0,1]\) and is the limit of the maximum normalized distance between a graph of density \(p\) and \(\mathbb H\). This paper utilizes a method due to \textit{A. Sidorenko} [Combinatorica 13, No. 1, 109--120 (1993; Zbl 0774.05051)], called ``symmetrization'', for computing the edit distance function of various hereditary properties. For any graph \(H\), \(\mathrm{Forb}(H)\) denotes the property of not having an induced copy of \(H\). This paper gives some results regarding estimation of the function for an arbitrary hereditary property. This paper also gives the edit distance function for \(\mathrm{Forb}(H)\), where \(H\) is a cycle on 9 or fewer vertices.