Menger's Theorem for a Countable Source Set

DOI10.1017/S0963548300001073MaRDI QIDQ4305312zbMATH OpenOpenAlexFDO

Authors Ron Aharoni, Reinhard Diestel

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

pathsdisjoint pathsinfinite graphseparatorMenger theoremcountable source set

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 970819
• Menger's theorem for infinite graphs
• Menger's theorem for infinite graphs with ends
• Menger's theorem for countable graphs

Cites work

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

Cited in

(10)

• Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
• Hindman's theorem is only a countable phenomenon
• Menger's theorem for infinite graphs with ends
• Menger's theorem for countable graphs
• Menger's theorem for infinite graphs
• Sur une extension du théorème de Menger aux graphes infinis. (On an extension of Menger's theorem to infinite graphs)
• The Erdős-Menger conjecture for source/sink sets with disjoint closures
• The countable Erdős-Menger conjecture with ends
• On packing and covering polyhedra in infinite dimensions
• Countable Menger's theorem with finitary matroid constraints on the ingoing edges

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305312)