Abstract
A survey is given on results concerning systems of disjoint (one-way) infinite paths in graphs. An important role is played by the “ends”, a concept by which the ramification of the infinite paths in a graph is reflected. Especially for locally finite graphs decompositions are given by which systems of infinite paths with certain properties can be studied in a fairly easy way. Those sets of vertices in a locally finite graph, which form the entity of initial vertices of some system of disjoint infinite paths, form an independence structure; the analogue is true, if one restricts oneself to the infinite paths in some given end.
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.
