A simple construction gives layered-wheel-like graphs with arbitrarily large treewidth, arbitrarily large girth, and every outerstring induced subgraph of bounded treewidth, refuting Trotignon's conjecture.
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A simple layered-wheel-like construction
A simple construction gives layered-wheel-like graphs with arbitrarily large treewidth, arbitrarily large girth, and every outerstring induced subgraph of bounded treewidth, refuting Trotignon's conjecture.