Menger's theorem
English
[edit]
Etymology
[edit]It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927.
Proper noun
[edit]- (graph theory) 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.