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 of graphs with large chromatic number. VIII. Long odd holes

Thumbnail Image

Files

Induced with large chromatic.pdf (240.21 KB)

Date

2020-01

Authors

Chudnovsky, Maria
Scott, Alex
Seymour, Paul
Spirkl, Sophie

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Abstract

We prove a conjecture of András Gyárfás, that for all k, l, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ.

Description

The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2019.05.001 © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/

Keywords

induced subgraphs, odd holes

LC Keywords

Citation

URI

https://doi.org/10.1016/j.jctb.2019.05.001
 http://hdl.handle.net/10012/18528

Collections

Waterloo Research
Combinatorics and Optimization