Infinite end-devouring sets of rays with prescribed start vertices
arXiv:1704.06577
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.
arXiv comment5 pages, 1 figure