Short proof of Menger's Theorem
✍ Scribed by F. Göring
- Book ID
- 108315503
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 39 KB
- Volume
- 219
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph __G__ if it holds for the graphs obtained from __G__ by deleting and contracting the same edge. The other two prove the directed version of
## Abstract A new proof of Menger's theorem is presented.
## Abstract A proof of Menger's theorem is presented.
## 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 ge