✦ LIBER ✦

A variation of Menger's theorem for long paths

✍ Scribed by L Montejano; V Neumann-Lara

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 230 KB
Volume: 36
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90026-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

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

Vulnerability of scheduled networks and

Vulnerability of scheduled networks and a generalization of Menger's Theorem

✍ Berman, Kenneth A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 859 KB

An edge-scheduled network N is a multigraph G = (V, E), where each edge e E E has been assigned two real weights: a start time a(e) and a finish time p(e). Such a multigraph models a communication or transportation network. A multiedge joining vertices u and v represents a direct communication (tran

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

A Mengerian theorem for paths of length

A Mengerian theorem for paths of length at least three

✍ Michael Hager 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

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 cardina