Journal article
Induced subgraphs of graphs with large chromatic number. III. Long holes
- Abstract:
- We prove a 1985 conjecture of Gyárfás that for all k, ℓ, every graph with sufficiently large chromatic number contains either a clique of cardinality more than k or an induced cycle of length more than ℓ.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 250.3KB)
-
- Publisher copy:
- 10.1007/s00493-016-3467-x
Authors
Bibliographic Details
- Publisher:
- Springer Berlin Heidelberg Publisher's website
- Journal:
- Combinatorica Journal website
- Volume:
- 37
- Issue:
- 6
- Pages:
- 1057–1072
- Publication date:
- 2016-11-28
- Acceptance date:
- 2016-03-22
- DOI:
- EISSN:
-
1439-6912
- ISSN:
-
0209-9683
- Source identifiers:
-
632957
Item Description
- Keywords:
- Pubs id:
-
pubs:632957
- UUID:
-
uuid:da0b21cb-00bf-4ef8-8298-fc3cf9b35170
- Local pid:
- pubs:632957
- Deposit date:
- 2016-07-09
Terms of use
- Copyright holder:
- János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg
- Copyright date:
- 2016
- Notes:
- This is an accepted manuscript of a journal article published by Springer in Combinatorica: an international journal on combinatorics and the theory of computing on 2016-11-28, available online: http://dx.doi.org/10.1007/s00493-016-3467-x
If you are the owner of this record, you can report an update to it here: Report update to this record