
The core message of this article is to introduce and analyze the Minimum Spanning Tree Cycle Intersection (MSTCI) problem, which aims to find a spanning tree that minimizes the number of non-empty intersections between cycles induced by the remaining edges.


coremsg

analyzing-the-minimum-spanning-tree-cycle-intersection-problem-in-graphs


Analyzing the Minimum Spanning Tree Cycle Intersection Problem in Graphs


title_rewrite


This paper presents two lower bounds for the intersection number of an arbitrary connected graph, which is a measure of the sparsity of the cycle intersection matrix induced by a spanning tree. The first lower bound is proven, while the second is conjectured based on experimental results.


lower-bounds-for-the-minimum-spanning-tree-cycle-intersection-problem


Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
