| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656761 | Journal of Combinatorial Theory, Series B | 2015 | 16 Pages |
Abstract
We show that any graph that contains k edge-disjoint double rays for any k∈Nk∈N contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nathan Bowler, Johannes Carmesin, Julian Pott,