Abstract
We introduce the notion of a lexicographic tree and prove that its existence is equivalent to the existence of a normal tree in an infinite graph. Further, we show that for any free set of ends in a connected countable graph and for any choice of pairwise disjoint rays representing this set (one ray per end), there exists an end-faithful spanning tree in the graph which contains the chosen rays.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
