Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth
Combinatorics
2024-12-30 v2
Abstract
The pathwidth of a graph is the smallest such that can be constructed from a sequence of graphs, each on at most vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth.
Keywords
Cite
@article{arxiv.2412.17756,
title = {Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth},
author = {Maria Chudnovsky and Sepehr Hajebi and Sophie Spirkl},
journal= {arXiv preprint arXiv:2412.17756},
year = {2024}
}