Menger's theorem for infinite graphs wit
✍
Henning Bruhn; Reinhard Diestel; Maya Stein
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 127 KB
## Abstract A well‐known conjecture of Erdős states that given an infinite graph __G__ and sets __A__, ⊆ __V__(__G__), there exists a family of disjoint __A__ − __B__ paths 𝓅 together with an __A__ − __B__ separator __X__ consisting of a choice of one vertex from each path in 𝓅. There is a natural