Menger's Theorem for a Countable Source Set

DOI10.1017/S0963548300001073zbMath0817.05037OpenAlexW2154460927MaRDI QIDQ4305312

Reinhard Diestel, Ron Aharoni

Publication date: 13 September 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001073

zbMATH Keywords

pathsinfinite graphdisjoint pathsseparatorMenger theoremcountable source set

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

The countable Erdős-Menger conjecture with ends ⋮ On packing and covering polyhedra in infinite dimensions ⋮ Menger's theorem for infinite graphs

Cites Work

• Menger's theorem for countable graphs
• König's Duality Theorem for Infinite Bipartite Graphs

This page was built for publication: Menger's Theorem for a Countable Source Set