All graphs have tree-decompositions displaying their topological ends

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
129 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)545-596
Number of pages52
JournalCombinatorica
Volume39
Issue number3
Early online date13 Mar 2019
DOIs
Publication statusPublished - Jun 2019

Keywords

  • math.CO
  • 05C63, 05B35

Fingerprint

Dive into the research topics of 'All graphs have tree-decompositions displaying their topological ends'. Together they form a unique fingerprint.

Cite this