Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth
Abstract
The pathwidth of a graph G is the smallest w∈ N such that G can be constructed from a sequence of graphs, each on at most w+1 vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth.
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.