End spaces and tree-decompositions

DOI10.1016/J.JCTB.2023.02.007zbMATH Open1512.05306arXiv2205.09865MaRDI QIDQ6038587FDOQ6038587

Authors: Marcel Koloschin, Thilo Krill, Max F. Pitz 

Publication date: 2 May 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be distinguished, and characterise which subsets of ends can be displayed by a tree-decomposition of finite adhesion. In particular, we show that a subset $Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion if and only if $Psi$ is $G_{d}elta$ (a countable intersection of open sets) in $|G|$, the topological space formed by a graph together with its ends. Since the undominated ends of a graph are easily seen to be $G_{d}elta$, this provides a structural explanation for Carmesin's result that the set of undominated ends can always be displayed.

Full work available at URL: https://arxiv.org/abs/2205.09865

Recommendations

• All graphs have tree-decompositions displaying their topological ends
• Canonical trees of tree-decompositions
• Ends and multi-endings. I
• Ends of graphs
• Ends and multi-endings. II

zbMATH Keywords

infinite graphtree decompositionend

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• The end structure of a graph: Recent results and open problems
• Graph-theoretical versus topological ends of graphs.
• Normal Spanning Trees, Aronszajn Trees and Excluded Minors
• Wurzelbäume und unendliche Wege in Graphen
• End spaces and spanning trees
• Topological cycle matroids of infinite graphs
• Dual trees must share their ends
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
• Ends and multi-endings. I
• Ends and multi-endings. II
• The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs
• A tree-of-tangles theorem for infinite tangles
• All graphs have tree-decompositions displaying their topological ends
• Countably determined ends and graphs
• Approximating infinite graphs by normal trees
• Duality theorems for stars and combs I: Arbitrary stars and combs
• Duality theorems for stars and combs II: Dominating stars and dominated combs
• Proof of Halin's normal spanning tree conjecture
• Constructing tree-decompositions that display all topological ends

Cited In (4)

• Canonical trees of tree-decompositions
• End spaces and spanning trees
• Countably determined ends and graphs
• All graphs have tree-decompositions displaying their topological ends

This page was built for publication: End spaces and tree-decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038587)