Menger's theorem
(redirected from Menger's n-arc theorem)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