Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole.
| dc.contributor.author | Chudnovsky, Maria | |
| dc.contributor.author | Hajebi, Sepehr | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.date.accessioned | 2024-10-28T14:38:19Z | |
| dc.date.available | 2024-10-28T14:38:19Z | |
| dc.date.issued | 2025-02 | |
| dc.description | © 2024 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). | |
| dc.description.abstract | A clock is a graph consisting of an induced cycle C and a vertex not in C with at least two non-adjacent neighbours in C. We show that every clock-free graph of large treewidth contains a "basic obstruction" of large treewidth as an induced subgraph: a complete graph, a subdivision of a wall, or the line graph of a subdivision of a wall. | |
| dc.description.sponsorship | NSF-EPSRC, Grant DMS-2120644 || AFOSR Grant, FA9550-22-1-0083 || NSERC, RGPIN-2020-03912. | |
| dc.identifier.uri | https://doi.org/10.1016/j.ejc.2024.104074 | |
| dc.identifier.uri | https://hdl.handle.net/10012/21169 | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.relation.ispartofseries | European Journal of Combinatorics; 124; 104074 | |
| dc.rights | Attribution 4.0 International | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.title | Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole. | |
| dc.type | Article | |
| dcterms.bibliographicCitation | Chudnovsky, M., Hajebi, S., & Spirkl, S. (2025). Induced subgraphs and tree decompositions XIV. non-adjacent neighbours in a Hole. European Journal of Combinatorics, 124, 104074. https://doi.org/10.1016/j.ejc.2024.104074 | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | Combinatorics and Optimization | |
| uws.peerReviewStatus | Reviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |