UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs.

Simple item page
dc.contributor.authorAbrishami, Tara
dc.contributor.authorAlecu, Bogdan
dc.contributor.authorChudnovsky, Maria
dc.contributor.authorHajebi, Sepehr
dc.contributor.authorSpirkl, Sophie
dc.date.accessioned2023-11-21T15:40:14Z
dc.date.available2023-11-21T15:40:14Z
dc.date.issued2024-01
dc.descriptionThe final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2023.10.008. © 2024. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.description.abstractWe say a class C of graphs is clean if for every positive integer t there exists a positive integer w(t) such that every graph in C with treewidth more than w(t) contains an induced subgraph isomorphic to one of the following: the complete graph Kt, the complete bipartite graph Kt,t, a subdivision of the (t × t)-wall or the line graph of a subdivision of the (t × t)-wall. In this paper, we adapt a method due to Lozin and Razgon (building on earlier ideas of Weißauer) to prove that the class of all H-free graphs (that is, graphs with no induced subgraph isomorphic to a fixed graph H) is clean if and only if H is a forest whose components are subdivided stars. Their method is readily applied to yield the above characterization. However, our main result is much stronger: for every forest H as above, we show that forbidding certain connected graphs containing H as an induced subgraph (rather than H itself) is enough to obtain a clean class of graphs. Along the proof of the latter strengthening, we build on a result of Davies and produce, for every positive integer η, a complete description of unavoidable connected induced subgraphs of a connected graph G containing η vertices from a suitably large given set of verticen
dc.description.sponsorshipNSF-EPSRC, Grant DMS-2120644 || AFOSR, Grant FA9550-22-1-0083 || DMS-EPSRC, Grant EP/V002813/1 || NSERC, RGPIN-2020-03912.en
dc.identifier.urihttps://doi.org/10.1016/j.jctb.2023.10.008
dc.identifier.urihttp://hdl.handle.net/10012/20106
dc.language.isoenen
dc.publisherElsevieren
dc.relation.ispartofseriesJournal of Combinatorial Theory, Series B;164
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectinduced subgraphen
dc.subjecttree decompositionen
dc.subjecttreewidthen
dc.titleInduced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs.en
dc.typeArticleen
dcterms.bibliographicCitationAbrishami, T., Alecu, B., Chudnovsky, M., Hajebi, S., & Spirkl, S. (2024). Induced subgraphs and tree decompositions VII. basic obstructions in H-free graphs. Journal of Combinatorial Theory, Series B, 164, 443–472. https://doi.org/10.1016/j.jctb.2023.10.008en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Combinatorics and Optimizationen
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
induced_subgraphs_VII.pdf
Size:
568.22 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.47 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Waterloo Research