The countable Erdős-Menger conjecture with ends
From MaRDI portal
Publication:1403915
DOI10.1016/S0095-8956(02)00032-1zbMath1021.05063MaRDI QIDQ1403915
Publication date: 20 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (5)
Graph-like continua, augmenting arcs, and Menger's theorem ⋮ Topological infinite gammoids, and a new Menger-type theorem for infinite graphs ⋮ The Lovász-Cherkassky theorem for locally finite graphs with ends ⋮ The Erdős-Menger conjecture for source/sink sets with disjoint closures ⋮ Locally finite graphs with ends: A topological approach. II: Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Menger's theorem for countable graphs
- A Mengerian theorem for infinite graphs with ideal points
- A note on Menger's theorem for infinite locally finite graphs
- Graph-theoretical versus topological ends of graphs.
- A General Criterion for the Existence of Transversals
- Menger's Theorem for a Countable Source Set
- König's Duality Theorem for Infinite Bipartite Graphs
- Hamiltonian Lines in Products of Infinite Trees
This page was built for publication: The countable Erdős-Menger conjecture with ends
