Edge-disjoint double rays in infinite graphs: a Halin type result
Combinatorics
2014-08-06 v4
Abstract
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981.
Keywords
Cite
@article{arxiv.1307.0992,
title = {Edge-disjoint double rays in infinite graphs: a Halin type result},
author = {Nathan Bowler and Johannes Carmesin and Julian Pott},
journal= {arXiv preprint arXiv:1307.0992},
year = {2014}
}
Comments
15 pages, 2 figures