Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs

Abstract

Given a graph $H$, we prove that every (theta, prism)-free graph of sufficiently large treewidth contains either a large clique or an induced subgraph isomorphic to $H$, if and only if $H$ is a forest.

References in corpus (2)

• Grid Induced Minor Theorem for Graphs of Small Degree
• Induced subgraphs and tree decompositions IV. (Even hole, diamond, pyramid)-free graphs

Cited by in corpus (2)

• Chordal graphs, even-hole-free graphs and sparse obstructions to bounded treewidth
• $t$-sails and sparse hereditary classes of unbounded tree-width