All graphs have tree-decompositions displaying their topological ends
  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. 
Johannes Carmesin
math.CO