Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs
Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, S·2023-01-06·via math.CO updates on arXiv.org
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.