Menger's theorem

English

Etymology

It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927.

Proper noun

Menger's theorem

  1. (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.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.