## 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 ✦
A remark on Menger's theorem
✍ Scribed by L. Lovász
- Publisher
- Akadmiai Kiad
- Year
- 1970
- Tongue
- English
- Weight
- 198 KB
- Volume
- 21
- Category
- Article
- ISSN
- 1588-2632
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 generalization of Menger’s Theorem
✍
Sunil Mathew; M.S. Sunitha
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 226 KB
This paper generalizes one of the celebrated results in Graph Theory due to Karl. A. Menger (1927), which plays a crucial role in many areas of flow and network theory. This paper also introduces and characterizes strength reducing sets of nodes and arcs in weighted graphs.
A proof of Menger's theorem
✍
J. S. Pym
📂
Article
📅
1969
🏛
Springer Vienna
🌐
English
⚖ 149 KB
A remark on Strassen's theorem
✍
I. Berkes
📂
Article
📅
1979
🏛
Akadmiai Kiad
🌐
English
⚖ 221 KB
A remark on Newman's theorem
✍
Yu. D. Burago; B. V. Kalinin
📂
Article
📅
1995
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 352 KB
A remark on Kolmogorov‚s theorem
✍
A. Kałamajska
📂
Article
📅
2002
🏛
Springer
🌐
English
⚖ 199 KB