Abrishami, TaraAlecu, BogdanChudnovsky, MariaHajebi, SepehrSpirkl, Sophie2024-04-222024-04-222024-04-08https://doi.org/10.1007/s00493-024-00097-0http://hdl.handle.net/10012/20469This is a post-peer-review, pre-copyedit version of an article published in [insert journal title]. The final authenticated version is available online at: https://doi.org/10.1007/s00493-024-00097-0Given 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.enArticle