English Dictionary

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.

日本語の意味

有限な無向グラフにおける連結性を、任意の頂点対間で存在可能な互いに交わらないパスの最小数という観点から特徴付ける定理

In the graduate course, the lecturer used several examples to illustrate Menger's theorem and its implications for network reliability.

大学院の講義で講師は、任意の2つの頂点間に見つかる互いに素な経路の最小数によって有限無向グラフの連結性を特徴付ける定理（メンガーの定理）とそれがネットワークの信頼性に与える影響を、いくつかの例を用いて説明した。

意味（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.