For a connected, weighed, undirected graph G: G has a unique MST, if for every cut of G there is a unique minimum weight edge crossing the cut.
Is this statement true?
I think false because for the following graph in the given link there can be multiple MSTs.
