GTAC 3.4: Menger's Theorem

Menger's Theorem is a powerful tool for reasoning about highly connected graphs. It says that between every pair of distinct vertices in a k-connected graph, there are k independent paths.