𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mengerian theorems for paths of bounded length

✍ Scribed by L. Lovász; V. Neumann-Lara; M. Plummer

Publisher
Springer Netherlands
Year
1978
Tongue
English
Weight
408 KB
Volume
9
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On line disjoint paths of bounded length
On line disjoint paths of bounded length
✍ Geoffrey Exoo 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 105 KB

In a recent paper Lovfisz, Neumann-Lara and Plummer proved some Mengerian theorems for paths of bounded length. In this note the line connectivity analogue of their problem "is considered. In [3] Lovfisz, Neumann-Lara and Plummer considered the problem of extending Monger's theorem to paths of boun

A counterexample to a conjecture on path
A counterexample to a conjecture on paths of bounded length
✍ Stephanie M. Boyles; Geoffrey Exoo 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract In a recent paper Lovász, Neumann‐Lara, and Plummer studied Mengerian theorems for paths of bounded length. Their study led to a conjecture concerning the extent to which Menger's theorem can fail when restricted to paths of bounded length. In this paper we offer counterexamples to this