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 ?
3](G) = k, by Menger's Theorem, there exist at least k + 1 internally disjoint x-y paths [P.
3](G) = k, by Menger's Theorem, it is easy to construct k + 1 internally disjoint S-trees.
Note that Menger's Theorem justifies the definition (see e.