Abstract
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.
Similar content being viewed by others
References
C. Bürger and J. Kurkofka: Duality theorems for stars and combs I: Stars and combs, Journal of Graph Theory, 2021.
J. Carmesin: All graphs have tree-decompositions displaying their topological ends, Combinatorica 39 (2019), 545–596.
R. Diestel: The end structure of a graph: recent results and open problems, Disc. Math. 100 (1992), 313–327.
R. Diestel: Graph Theory, Springer, 5th edition, 2015.
R. Diestel and D. Kühn: Graph-theoretical versus topological ends of graphs, J. Combin. Theory, Series B 87 (2003), 197–206.
R. Halin: Über unendliche Wege in Graphen, Mathematische Annalen 157 (1964), 125–137.
J. Kurkofka and M. Pitz: A representation theorem for end spaces of infinite graphs, arXiv: 2111.12670.
P. Seymour and R. Thomas: An end-faithful spanning tree counterexample, Proceedings of the American Mathematical Society 113 (1991), 1163–1171.
C. Thomassen: Infinite connected graphs with no end-preserving spanning trees, Journal of Combinatorial Theory, Series B 54 (1992), 322–324.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pitz, M. Constructing Tree-Decompositions That Display All Topological Ends. Combinatorica 42, 763–769 (2022). https://doi.org/10.1007/s00493-022-4987-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-022-4987-1