Infinite end-devouring sets of rays with prescribed start vertices
classification
🧮 math.CO
keywords
raysstartdisjointprescribedverticesconfirmsconjecturecontains
read the original 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.
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.