We discuss a few issues concerning Erdős’ conjecture on the extension of Menger’s theorem to infinite graphs. A key role is given to a lemma to which the conjecture can probably be reduced. The paper is intended to be expository, so rather than claim completeness of proofs, we chose to prove the reduction only for graphs of size ℵ 1. We prove the lemma (and hence the ℵ 1 case of the conjecture) in two special cases: graphs with countable out-degrees, and graphs with no unending paths. We also present new versions of the proofs of the (already known) cases of countable graphs and graphs with no infinite paths. A main tool used is a transformation converting the graph into a bipartite graph.
CITATION STYLE
Aharoni, R. (2013). A few remarks on a conjecture of erdős on the infinite version of menger’s theorem. In The Mathematics of Paul Erdos II, Second Edition (pp. 335–352). Springer New York. https://doi.org/10.1007/978-1-4614-7254-4_21
Mendeley helps you to discover research relevant for your work.