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.
Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.
