Could someone provide me with a good reference for a proof of Konig's Theorem for bipartite graphs from Menger's Theorem?
Konig's Theorem is as follows:
For a bipartite graph $G$, the maximum size of a matching equals the minimum size of a vertex cover.
Menger's Theorem is as follows:
Let $G$ be a graph and let $u$ and $v$ be two nonadjacent vertices. Then the minimum vertex cut for $u$ and $v$ (the minimum number of vertices whose removal disconnects $u$ and $v$) is equal to the maximum number of pairwise vertex-disjoint $u,v$-paths.