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.

中文翻译：

---

诱导子图和树分解 VIII：排除 (Theta, Prism)-Free 图中的森林

给定图H，我们证明每个足够大树宽的无（θ，棱镜）图包含一个大团或与H同构的诱导子图，当且仅当H是森林时。