✦ LIBER ✦

Menger’s theorem for infinite graphs

✍ Scribed by Ron Aharoni; Eli Berger

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 654 KB
Volume: 176
Category: Article
ISSN: 0020-9910
DOI: 10.1007/s00222-008-0157-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Menger's theorem for infinite graphs wit

Menger's theorem for infinite graphs with ends

✍ Henning Bruhn; Reinhard Diestel; Maya Stein 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract A well‐known conjecture of Erdős states that given an infinite graph __G__ and sets __A__, ⊆ __V__(__G__), there exists a family of disjoint __A__ − __B__ paths 𝓅 together with an __A__ − __B__ separator __X__ consisting of a choice of one vertex from each path in 𝓅. There is a natural

Menger's theorem for countable graphs

✍ Ron Aharoni 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 609 KB

Applications of Menger's graph theorem

✍ Hazel Perfect 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 844 KB

Whitney's theorem for infinite graphs

✍ A.R. Bednarek 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 111 KB

A generalization of Menger's theorem for

A generalization of Menger's theorem for certain unicyclic graphs

✍ E. Sampathkumar 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 154 KB

Menger's Theorem

✍ T. Böhme; F. Göring; J. Harant 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB

## 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