✦ LIBER ✦

Menger's Theorem and Matroids

✍ Scribed by Brualdi, R. A.

Book ID: 120097420
Publisher: Oxford University Press
Year: 1971
Tongue: English
Weight: 146 KB
Volume: s2-4
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-4.1.46

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

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

Extensions of Menger's Theorem

✍ Dirac, G. A. 📂 Article 📅 1963 🏛 Oxford University Press 🌐 English ⚖ 403 KB

On separating sets and menger's theorem

✍ Gabriel Dirac 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 998 KB

Menger's theorem for countable graphs

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

A remark on Menger's theorem

✍ L. Lovász 📂 Article 📅 1970 🏛 Akadmiai Kiad 🌐 English ⚖ 198 KB

Menger’s theorem for infinite graphs

✍ Ron Aharoni; Eli Berger 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 654 KB