Menger's theorem

短语

释义与例句

name
  1. 1.

    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.

    数学

词源

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

来源：wiktionary