A Short Proof of Maderʹs S-Paths Theorem

For an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a path connecting different sets in S. We give a short proof of Maderʹs min-max theorem for the maximum number of disjoint S-paths.