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$，设$T$为$G$的一棵生成树。每条边$e \in G-T$在$T \cup \{e\}$中诱导一个环路。两个不同此类环路的交集是指同时属于这两个环路的$T$中边的集合。本文研究寻找具有最少此类非空交集的生成树问题。