Minimizing Spanning Tree Cycle Intersections: Theoretical Insights and Experimental Analysis

The article presents theoretical and experimental analyses of the Minimum Spanning Tree Cycle Intersection (MSTCI) problem, which aims to find a spanning tree with the least number of pairwise intersections of the cycles it induces. The authors explore lower bounds, the relationship between a graph and its successors, and attempt to generalize a known result for graphs with a universal vertex.