Edge-disjoint double rays in infinite graphs:: a Halin type result

Nathan Bowler; Johannes Carmesin; Julian Pott

doi:10.1016/j.jctb.2014.08.005

Edge-disjoint double rays in infinite graphs: a Halin type result

Nathan Bowler, Johannes Carmesin, Julian Pott

Mathematics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

148 Downloads (Pure)

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.

Original language	English
Pages (from-to)	1-16
Number of pages	16
Journal	Journal of Combinatorial Theory. Series B
Volume	111
Early online date	31 Oct 2014
DOIs	https://doi.org/10.1016/j.jctb.2014.08.005
Publication status	Published - 1 Mar 2015

Bibliographical note

15 pages, 2 figures

Keywords

math.CO
05C63
graph theory
infinite graphs
ray
double-ray
end
ubiquitous
edge-ubiquitous

Access to Document

10.1016/j.jctb.2014.08.005Licence: None: All rights reserved

Bowler_et_al_Edge-disjoint_double_rays_Journal_of_Combinatorial_Theory_Series_B_2014Accepted author manuscript, 350 KBLicence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

https://www.sciencedirect.com/science/article/pii/S0095895614001002Licence: None: All rights reserved

Cite this

@article{9d194e5d6e8b424bb0640704064da93b,

title = "Edge-disjoint double rays in infinite graphs:: a Halin type result",

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 = "math.CO, 05C63, graph theory, infinite graphs, ray, double-ray, end, ubiquitous, edge-ubiquitous",

author = "Nathan Bowler and Johannes Carmesin and Julian Pott",

note = "15 pages, 2 figures",

year = "2015",

month = mar,

day = "1",

doi = "10.1016/j.jctb.2014.08.005",

language = "English",

volume = "111",

pages = "1--16",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Elsevier",

}

TY - JOUR

T1 - Edge-disjoint double rays in infinite graphs:

T2 - a Halin type result

AU - Bowler, Nathan

AU - Carmesin, Johannes

AU - Pott, Julian

N1 - 15 pages, 2 figures

PY - 2015/3/1

Y1 - 2015/3/1

N2 - 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.

AB - 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.

KW - math.CO

KW - 05C63

KW - graph theory

KW - infinite graphs

KW - ray

KW - double-ray

KW - end

KW - ubiquitous

KW - edge-ubiquitous

U2 - 10.1016/j.jctb.2014.08.005

DO - 10.1016/j.jctb.2014.08.005

M3 - Article

SN - 0095-8956

VL - 111

SP - 1

EP - 16

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

ER -