Answers are grounded in this paper and cite their sources.
Graph-theoretic analysis characterizes unavoidable induced subgraphs in graphs with large pathwidth, establishing complete structural obstructions for linear decompositions.
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.
No takes yet. Share an insight, caveat, or question.
Chudnovsky et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: