Let $e$ be an edge of minimum weight in the connected weighted graph $G$. Every minimum spanning tree of $G$ contains $e$.
I have been told that this is not true. But I also know this property : Must a minimum weight spanning tree for a graph contain the least weight edge of every vertex of the graph?
Is it not true because that $e$ is not necessary the only minimum weight edge?