All graphs have tree-decompositions displaying their topological ends
classification
🧮 math.CO
keywords
endstopologicalconjectureconnectedcorrecteddiesteldisplayingdisplays
read the original abstract
We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.