Infinite end-devouring sets of rays with prescribed start vertices
Combinatorics
2017-04-24 v1
Abstract
We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of Georgakopoulos.
Keywords
Cite
@article{arxiv.1704.06577,
title = {Infinite end-devouring sets of rays with prescribed start vertices},
author = {J. Pascal Gollin and Karl Heuer},
journal= {arXiv preprint arXiv:1704.06577},
year = {2017}
}
Comments
5 pages, 1 figure