Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. We consider the problem of finding a spanning tree that has the least number of such non-empty intersections.

翻译：考虑一个连接的图形$G$, 并让美元成为一棵以G$为圆形的树。 每个边端$$$ 以G-T$为单位, 产生一个周期, 以$T\ cup @ e @ ⁇ $为单位。 两个不同的周期的交汇点是属于两个周期的一套以$T为单位的边点。 我们考虑了找到一个非空的交叉点最少的横形树的问题 。