Edge Disjoint Path Problem and Menger's Theorem

This video considers the disjoint-path problem and Menger's theorem which is a basic result about connectivity in finite directed and undirected graphs. The edge-connectivity version of Menger's theorem is as follows: Let G be a finite directed graph and x and y two distinct vertices. Then the theorem states that the size of the minimum edge cut for x and y (the minimum number of edges whose removal disconnects x and y) is equal to the maximum number of pairwise edge-independent paths from x to y.