solidot新版网站常见问题，请点击这里查看。
消息
本文已被查看176次
Infinite end-devouring sets of rays with prescribed start vertices. (arXiv:1704.06577v1 [math.CO])
来源于:arXiv
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. 查看全文>>
