Menger's Theorem for digraphs states that for any two vertex sets A and B o
f 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 element
ary proof of a more general theorem is given. (C) 2001 John Wiley & Sons, I
nc.