1 paper · 1 filter
James S. Barnes, Jun Le Goh, Richard A. Shore
Halin [1965] proved that if a graph has n many pairwise disjoint rays for each n then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other…