2017/04/21 by Gollin, J. Pascal, Heuer, Karl
#05C63 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1704.06577
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.