Counterexamples regarding linked and lean tree-decompositions of infinite graphs
Abstract
Kriz and Thomas showed that every (finite or infinite) graph of tree-width k ∈ N admits a lean tree-decomposition of width k. We discuss a number of counterexamples demonstrating the limits of possible generalisations of their result to arbitrary infinite tree-width. In particular, we construct a locally finite, planar, connected graph that has no lean tree-decomposition.
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.