Skip to main content

INDUCED SUBGRAPHS OF GRAPHS WITH LARGE CHROMATIC NUMBER. III. LONG HOLES

Author(s): Chudnovsky, Maria; Scott, Alex; Seymour, Paul D

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr10g3gz02
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChudnovsky, Maria-
dc.contributor.authorScott, Alex-
dc.contributor.authorSeymour, Paul D-
dc.date.accessioned2023-12-11T16:33:07Z-
dc.date.available2023-12-11T16:33:07Z-
dc.date.issued2017-12en_US
dc.identifier.citationChudnovsky, 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-xen_US
dc.identifier.issn0209-9683-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr10g3gz02-
dc.description.abstractWe 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.en_US
dc.format.extent1057 - 1072en_US
dc.language.isoen_USen_US
dc.relation.ispartofCOMBINATORICAen_US
dc.rightsAuthor's manuscripten_US
dc.titleINDUCED SUBGRAPHS OF GRAPHS WITH LARGE CHROMATIC NUMBER. III. LONG HOLESen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1007/s00493-016-3467-x-
dc.date.eissued2016-11-28en_US
dc.identifier.eissn1439-6912-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
1506.02232v2.pdf136.47 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.