Menger's theorem for infinite graphs
| dc.creator | Aharoni, Ron | |
| dc.creator | Berger, Eli | |
| dc.date | 2005-09-18 | |
| dc.date | 2007-12-03 | |
| dc.date.accessioned | 2026-07-07T08:46:34Z | |
| dc.date.available | 2026-07-07T08:46:34Z | |
| dc.description | We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of vertices separating $A$ from $B$, such that $S$ consists of a choice of precisely one vertex from each path in $\cp$. This settles an old conjecture of Erdős. | |
| dc.description | 53 pages, final version submitted | |
| dc.identifier | https://arxiv.org/abs/math/0509397 | |
| dc.identifier | http://arxiv.org/abs/math/0509397 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/143291 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05 | |
| dc.title | Menger's theorem for infinite graphs | |
| dc.type | text |