Menger's theorem

English

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

Menger's theorem

(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.

单词	Menger's theorem
释义	Menger's theorem English Etymology It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927. Proper noun Menger's theorem (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.
随便看	Henandez Henandezes henanense henanensem henanenses henanensi henanensia henanensibus henanensis henanensium Henao henar Henard Henards Henares henares henatchoroi henatra Henault Henaults henbane henbanes henbilen henbilke henbilkeen