Menger's Theorem
Thomas J. Böhme, Frank Göring, Jochen Harant · Journal of Graph Theory · 2001
Abstract Menger's Theorem for digraphs states that for any two vertex sets A and B of a digraph D such that A cannot be separated from B by a set of at most t vertices, there are t + 1 disjoint A – B ‐paths in D . Here a short and elementary proof of a more general theorem is given. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 35–36, 2001