Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs
Loading...
Date
Authors
Abrishami, Tara
Alecu, Bogdan
Chudnovsky, Maria
Hajebi, Sepehr
Spirkl, Sophie
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
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.
Description
This 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-0