Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917976743084032 |
|---|---|
| author | Abrishami, Tara Alecu, Bogdan Chudnovsky, Maria Hajebi, Sepehr Spirkl, Sophie |
| author_facet | Abrishami, Tara Alecu, Bogdan Chudnovsky, Maria Hajebi, Sepehr Spirkl, Sophie |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2301_02138 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs Abrishami, Tara Alecu, Bogdan Chudnovsky, Maria Hajebi, Sepehr Spirkl, Sophie Combinatorics 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. |
| title | Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2301.02138 |