๐ Menger
The maximum number of edge-disjoint $u$-$v$ paths equals the minimum size of an edge cut separating $u$ and $v$.
Proof: Reduce to vertex version: construct $G\
From: Introduction to Graph Theory
Learn more:
Explore all courses: 
Introduction to Graph Theory | Math Academy
Interactive course based on Douglas B. West

Magic Internet Math
Interactive courses covering the mathematics that powers modern technology, from foundational algebra to the cryptography securing the internet.