Edge-disjoint double rays in infinite graphs: a Halin type result
classification
🧮 math.CO
keywords
doubleedge-disjointrayscontainsandreaeconjecturedgraphgraphs
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.