Menger's theorem
Meanings
name
- 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.
Word forms
Etymology
It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927.
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.