Abstract
We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be distinguished, and characterise which subsets of ends can be displayed by a tree-decomposition of finite adhesion.In particular, we show that a subset Κ of the ends of a graph G can be displayed by a tree-decomposition of finite adhesion if and only if Κ is GΎ (a countable intersection of open sets) in |G|, the topological space formed by a graph together with its ends. Since the undominated ends of a graph are easily seen to be GΎ, this provides a structural explanation for Carmesin's result that the set of undominated ends can always be displayed.
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.
