@article{bedcd0987bcb4485b79149206bbc68e7,
title = "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.",
author = "Tara Abrishami and Bogdan Alecu and Maria Chudnovsky and Sepehr Hajebi and Sophie Spirkl",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive licence to J{\'a}nos Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature 2024.",
year = "2024",
doi = "10.1007/s00493-024-00097-0",
language = "English (US)",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
}