Abstract
Let A be a family of sets of ends of an infinite graph, having the property that every element of any member of A can be separated from the union of all other members by a finite set of vertices. By defining appropriate concepts of A–paths and of A–separators, we show that there are a set of pairwise disjoint A–paths and an A–separator which have the same ‘cardinality’.
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.
