✦ LIBER ✦
A Mengerian theorem for paths of length at least three
✍ Scribed by Michael Hager
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 303 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Let be x, y two vertices of a graph G, such that t openly disjoint xy-paths of length 2 3 exist. In this article we show that then there exists a set S of cardinality less than or equal to 3 t -2, resp. 2 t for t E {1,2,3}, which destroys all xy-paths of length 23. Also a lower bound for the cardinality of S is given by constructing special graphs.