## 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
β¦ LIBER β¦
On separating sets and menger's theorem
β Scribed by Gabriel Dirac
- Publisher
- Elsevier Science
- Year
- 1973
- Weight
- 998 KB
- Volume
- 76
- Category
- Article
- ISSN
- 1385-7258
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Menger's Theorem
β
T. BΓΆhme; F. GΓΆring; J. Harant
π
Article
π
2001
π
John Wiley and Sons
π
English
β 47 KB
A remark on Menger's theorem
β
L. LovΓ‘sz
π
Article
π
1970
π
Akadmiai Kiad
π
English
β 198 KB
More proofs of menger's theorem
β
C. St. J. A. Nash-Williams; W. T. Tutte
π
Article
π
1977
π
John Wiley and Sons
π
English
β 231 KB
## 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
Separation theorems and minimax theorems
β
M. Takahashi; W. Takahashi
π
Article
π
1980
π
Springer
π
English
β 737 KB
A new proof of menger's theorem
β
Peter V. O'Neil
π
Article
π
1978
π
John Wiley and Sons
π
English
β 134 KB
π 1 views
## Abstract A new proof of Menger's theorem is presented.
A simple proof of Menger's theorem
β
William McCuaig
π
Article
π
1984
π
John Wiley and Sons
π
English
β 111 KB
π 1 views
## Abstract A proof of Menger's theorem is presented.