Menger theorem
= Menger theorem
{c}
= Menger's theorem
{c}
{synonym}
The maximum number of disjoint paths joining two vertex sets equals the minimum size of a separating set, with vertex and edge versions according to the chosen notion of disjointness.