Menger's theorem


Also found in: Wikipedia.

Menger's theorem

[′meŋ·ərz ‚thir·əm]
(mathematics)
A theorem in graph theory which states that if G is a connected graph and A and B are disjoint sets of points of G, then the minimum number of points whose deletion separates A and B is equal to the maximum number of disjoint paths between A and B
References in periodicals archive ?
Note that Menger's Theorem justifies the definition (see e.
Hence, the graph G is [(3/ln 2)ln n + O(ln ln-connected by Menger's Theorem [1].