English

Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs

Combinatorics 2025-04-08 v2

Abstract

Given a graph HH, we prove that every (theta, prism)-free graph of sufficiently large treewidth contains either a large clique or an induced subgraph isomorphic to HH, if and only if HH is a forest.

Keywords

Cite

@article{arxiv.2301.02138,
  title  = {Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs},
  author = {Tara Abrishami and Bogdan Alecu and Maria Chudnovsky and Sepehr Hajebi and Sophie Spirkl},
  journal= {arXiv preprint arXiv:2301.02138},
  year   = {2025}
}