It also implies the topological Menger theorem of Diestel for locally finite graphs.doi:10.4028/www.scientific.net/AMM.563.362Johannes CarmesinEprint ArxivTopological infinite gammoids, and a new menger-type theorem for infinite graphs, arXiv:1404.0151, 2014....
Here is a more detailed version of the proof of Menger’s theorem on page 50 of Diestel’s book. First let’s clarify some details about “separating.” Given two sets of vertices A and B in G, a third set of vertices W separates A from B if ...
Menger's theorem for infinite graphs with ends A well-known conjecture of Erds states that given an infinite graph G and sets A , V ( G ), there exists a family of disjoint A - B paths together with an ... H Bruhn,R Diestel,M Stein - 《Journal of Graph Theory》 被引量: 28发表...
Menger's theorem for infinite graphs with ends A well-known conjecture of Erds states that given an infinite graph G and sets A , V ( G ), there exists a family of disjoint A - B paths together with an ... H Bruhn,R Diestel,M Stein - 《Journal of Graph Theory》 被引量: 29发表...
Theorem 3.1. (Aharoni 1987) G satisfies the Erd˝os-Menger conjecture for all sets A, B ⊆ V . When proving Theorem 3.1 one may clearly assume that Z := A∩B = ∅: having solved the problem for G−Z, just add every z ∈ Z to X and, as a singleton path { z }, ...
Diestel, M. Stein, Menger's theorem for infinite graphs with ends, J. Graph Theory 50 (2005) 199-211.H. Bruhn, R. Diestel, and M. Stein. Menger's theorem for infinite graphs with ends. To appear in J. Graph. Theory.H. Bruhn, R. Diestel & M. Stein, Menger's theorem for ...