Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path.
| dc.contributor.author | Scott, Alex | |
| dc.contributor.author | Seymour, Paul | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.date.accessioned | 2024-10-28T14:38:14Z | |
| dc.date.available | 2024-10-28T14:38:14Z | |
| dc.date.issued | 2023-09-15 | |
| dc.description | This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. | |
| dc.description.abstract | A graph G is H -free if it has no induced subgraph isomorphic to H. We prove that a P5-free graph with clique number ω ≥ 3 has chromatic number at most ωlog2(ω). The best previous result was an exponential upper bound (5/27)3ω, due to Esperet, Lemoine, Maffray, and Morel. A polynomial bound would imply that the celebrated Erd˝os-Hajnal conjecture holds for P5, which is the smallest open case. Thus, there is great interest in whether there is a polynomial bound for P5-free graphs, and our result is an attempt to approach that. | |
| dc.description.sponsorship | EPSRC Grant, EP/V007327/1 || AFOSR Grant, FA9550-22-1-0234 || NSF Grant, DMS-2154169 || NSERC, RGPIN-2020-03912. | |
| dc.identifier.uri | https://doi.org/10.1007/s00493-023-00015-w | |
| dc.identifier.uri | https://hdl.handle.net/10012/21168 | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.relation.ispartofseries | Combinatorica; 43 | |
| dc.rights | Attribution 4.0 International | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | chromatic number | |
| dc.subject | induced subgraphs | |
| dc.title | Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. | |
| dc.type | Article | |
| dcterms.bibliographicCitation | Scott, A., Seymour, P., & Spirkl, S. (2023). Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path. Combinatorica, 43(5), 845–852. https://doi.org/10.1007/s00493-023-00015-w | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | Combinatorics and Optimization | |
| uws.peerReviewStatus | Reviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |