A refinement of Halin's end-faithful spanning tree theorem (Q2640605): Difference between revisions

A subgraph H of G is called end-faithful if each end of G contains a ray of H and any two rays in H which belong to the same end of G belong to the same end of H. The authors show that an end-faithful subgraph H of the connected countable graph G can be extended to an end-faithful spanning tree of G if (a) H is a union of countably many disjoint rays or (b) H is a tree.