**1**

Menger’s theorem

6 Menger results for paths of bounded length

*In its best-known version*, *Menger’s theorem states that the maximum number of pairwise internally disjoint paths between a given pair of non-adjacent vertices in a graph equals the minimum number of vertices whose deletion disconnects the pair. Thus*, *the maximum number of pairwise internally disjoint paths that connect a given pair of vertices is a local measure that indicates how well two given vertices are connected. The connectivity of a graph is the minimum number of vertices whose ...*

Start Free Trial

No credit card required