For an undirected graph G = (V, E) and a collection f of disjoint Subsets o
f V, an f-path is a path connecting different sets in f, We give a short pr
oof of Mader's min-max theorem for the maximum number of disjoint f-paths.
(C) 2001 Academic Press.