Menger's theorem

Min cut between s,t = max flow from s to t (vertex or edge version). Max-flow min-cut as generalization. Basic connectivity result.