6 citations · 16 across the 24 of their papers we have counts for
1 paper · 1 filter
J. Pascal Gollin, Karl Heuer
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 o…