Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs
| dc.contributor.author | Abrishami, Tara | |
| dc.contributor.author | Alecu, Bogdan | |
| dc.contributor.author | Chudnovsky, Maria | |
| dc.contributor.author | Hajebi, Sepehr | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.date.accessioned | 2024-04-22T14:49:33Z | |
| dc.date.available | 2024-04-22T14:49:33Z | |
| dc.date.issued | 2024-04-08 | |
| dc.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 | en |
| dc.description.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. | en |
| dc.description.sponsorship | NSF-EPSRC, DMS-2120644 || AFOSR, FA9550-22-1-0083 || DMS-EPSRC, EP/V002813/1 || NSERC, RGPIN-2020-03912. | en |
| dc.identifier.uri | https://doi.org/10.1007/s00493-024-00097-0 | |
| dc.identifier.uri | http://hdl.handle.net/10012/20469 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Combinatorica; | |
| dc.title | Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Abrishami, T., Alecu, B., Chudnovsky, M., Hajebi, S., & Spirkl, S. (2024). Induced subgraphs and tree decompositions VIII: Excluding a forest in (Theta, prism)-free graphs. Combinatorica. https://doi.org/10.1007/s00493-024-00097-0 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.typeOfResource | Text | en |