Displaying prescribed sets of ends by linked tree-decompositions
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918249104408576 |
|---|---|
| author | Albrechtsen, Sandra Pitz, Max Schaut, Roman |
| author_facet | Albrechtsen, Sandra Pitz, Max Schaut, Roman |
| contents | We show that if a subset $Ψ$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial information of the ends in $Ψ$: their degrees, their sets of dominating vertices, and their combined degrees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_13457 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Displaying prescribed sets of ends by linked tree-decompositions Albrechtsen, Sandra Pitz, Max Schaut, Roman Combinatorics 05C63, 05C05, 05C83, 05C40 We show that if a subset $Ψ$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial information of the ends in $Ψ$: their degrees, their sets of dominating vertices, and their combined degrees. |
| title | Displaying prescribed sets of ends by linked tree-decompositions |
| topic | Combinatorics 05C63, 05C05, 05C83, 05C40 |
| url | https://arxiv.org/abs/2512.13457 |