Article ID Journal Published Year Pages File Type
8902969 Discrete Mathematics 2018 4 Pages PDF
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.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Infinite end-devouring sets of rays with prescribed start vertices
Authors
, ,