Maximum Weight Edge in all Minimum Spanning Trees is Bridge

Theorem

Let $G$ be an undirected network.

Let every edge of $G$ have a unique weight.

Let $e$ be an edge of $G$ that belongs to every minimum spanning tree of $G$.

Let $e$ have maximum weight in $G$.

Then $e$ is a bridge in $G$.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.