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 language | English |
---|---|
Pages (from-to) | 545-596 |
Number of pages | 52 |
Journal | Combinatorica |
Volume | 39 |
Issue number | 3 |
Early online date | 13 Mar 2019 |
DOIs | |
Publication status | Published - Jun 2019 |
Keywords
- math.CO
- 05C63, 05B35