Communication
Short proof of Menger's Theorem

https://doi.org/10.1016/S0012-365X(00)00088-1Get rights and content
Under an Elsevier user license
open archive

Abstract

A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a finite digraph for two subsets A and B of its vertex set is given.

MSC

05C40

Keywords

Connectivity
Disjoint paths
Digraph
Menger

Cited by (0)