The edit distance function for graphs: an exploration of the case of forbidden induced K<sub>2,t</sub> and other questions
Is Version Of
This thesis examines the edit distance function for principal hereditary properties of the form Forb(K2,t), the hereditary property of graphs containing no induced bipartite subgraph on 2 and t vertices. It explores applications of several methods from the literature for determining these edit distance functions, and also constructions from classical graph theory problems that can be used to create colored regularity graphs leading to upper bounds on the functions. Results include the entire edit distance function when t=3 and 4, as well as bounds for larger values of t, including the result that the maximum value of the function occurs over a nondegenerate interval of values for odd t.