INDUCED SUBGRAPHS OF GRAPHS WITH LARGE CHROMATIC NUMBER. III. LONG HOLES
Author(s): Chudnovsky, Maria; Scott, Alex; Seymour, Paul D
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr10g3gz02| Abstract: | We prove a 1985 conjecture of Gy´arf´as that for all k, l, every graph with sufficiently large chromatic number contains either a clique of cardinality more than k or an induced cycle of length more than l. |
| Publication Date: | Dec-2017 |
| Electronic Publication Date: | 28-Nov-2016 |
| Citation: | Chudnovsky, Maria, Scott, Alex, Seymour, Paul. (2017). INDUCED SUBGRAPHS OF GRAPHS WITH LARGE CHROMATIC NUMBER. III. LONG HOLES. COMBINATORICA, 37 (1057 - 1072. doi:10.1007/s00493-016-3467-x |
| DOI: | doi:10.1007/s00493-016-3467-x |
| ISSN: | 0209-9683 |
| EISSN: | 1439-6912 |
| Pages: | 1057 - 1072 |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | COMBINATORICA |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.