Polynomial bounds for chromatic number. III. Excluding a double star
| dc.contributor.author | Scott, Alex | |
| dc.contributor.author | Seymour, Paul | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.date.accessioned | 2022-08-12 01:17:27 (GMT) | |
| dc.date.available | 2022-08-12 01:17:27 (GMT) | |
| dc.date.issued | 2022-10 | |
| dc.identifier.uri | https://doi.org/10.1002/jgt.22862 | |
| dc.identifier.uri | http://hdl.handle.net/10012/18534 | |
| dc.description | This is the peer reviewed version of the following article: Scott, A., Seymour, P., & Spirkl, S. (2022). Polynomial bounds for chromatic number. III. Excluding a double star. Journal of Graph Theory, 101(2), 323–340. https://doi.org/10.1002/jgt.22862, which has been published in final form at https://doi.org/10.1002/jgt.22862. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. | en |
| dc.description.abstract | A “double star” is a tree with two internal vertices. It is known that the Gyárfás-Sumner conjecture holds for double stars, that is, for every double star H, there is a function fH such that if G does not contain H as an induced subgraph then x(G) ≤ fH(w(G)) (where x, w are the chromatic number and the clique number of G). Here we prove that fH can be chosen to be a polynomial. | en |
| dc.description.sponsorship | 1Research supported by EPSRC grant EP/V007327/1. Supported by AFOSR grant A9550-19-1-0187, and by NSF grant DMS-1800053. We acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (NSERC) [funding reference number RGPIN-2020-03912]. | en |
| dc.language.iso | en | en |
| dc.publisher | Wiley | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | polynomial bounds | en |
| dc.subject | chromatic number | en |
| dc.subject | double star | en |
| dc.title | Polynomial bounds for chromatic number. III. Excluding a double star | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Scott, A., Seymour, P., & Spirkl, S. (2022). Polynomial bounds for chromatic number. III. Excluding a double star. Journal of Graph Theory, 101(2), 323–340. https://doi.org/10.1002/jgt.22862 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International