All graphs have tree-decompositions displaying their topological ends
Combinatorics
2018-02-07 v5
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.
Keywords
Cite
@article{arxiv.1409.6640,
title = {All graphs have tree-decompositions displaying their topological ends},
author = {Johannes Carmesin},
journal= {arXiv preprint arXiv:1409.6640},
year = {2018}
}