A Short Proof of Mader's S-Paths Theorem
✍
Alexander Schrijver
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 78 KB
For an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a path connecting different sets in S. We give a short proof of Mader's min-max theorem for the maximum number of disjoint S-paths. 2001