The story
It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927.
Etymology from Wiktionary, CC BY-SA 4.0.
Menger's theorem
Today it means: A characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices. Full definition →