Menger's theorem for countable graphs
From MaRDI portal
Publication:1094433
DOI10.1016/0095-8956(87)90006-2zbMath0631.05032OpenAlexW2059748966MaRDI QIDQ1094433
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90006-2
Related Items
Countable Menger's theorem with finitary matroid constraints on the ingoing edges ⋮ Topological infinite gammoids, and a new Menger-type theorem for infinite graphs ⋮ The Menger property for infinite ordered sets ⋮ Menger's Theorem for a Countable Source Set ⋮ Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\) ⋮ The countable Erdős-Menger conjecture with ends ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Infinite matching theory ⋮ The Erdős-Menger conjecture for source/sink sets with disjoint closures ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Strongly maximal antichains in posets ⋮ On packing and covering polyhedra in infinite dimensions ⋮ Menger's theorem for infinite graphs ⋮ Metric dimensions of minor excluded graphs and minor exclusion in groups ⋮ LP duality in infinite hypergraphs
Cites Work
