Let be a graph with and two disjoint -tuples of Vertices. Then either contains pairwise disjoint -paths, each connecting a point of and a point of , or there exists a set of fewer than Vertices that separate and .

**References**

Menger, K. *Kurventheorie.* Leipzig, Germany: Teubner, 1932.

© 1996-9

1999-05-26