Displaying prescribed sets of ends by linked tree-decompositions
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.