  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.
