Journal article
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyarfas' conjectures
- Abstract:
-
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no odd hole of length more than ℓ has chromatic number bounded by a function of k, ℓ. We prove three weaker statements:. •Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five;•For all ℓ, every triangle-free graph with sufficiently large chromatic number contains either a 5-hole or an odd hole of length more than ℓ•For all k, ℓ, every gra...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 267.0KB)
-
- Publisher copy:
- 10.1016/j.jctb.2016.01.003
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Journal of Combinatorial Theory, Series B Journal website
- Volume:
- 118
- Pages:
- 109-128
- Publication date:
- 2016-01-27
- Acceptance date:
- 2015-08-28
- DOI:
- EISSN:
-
1096-0902
- ISSN:
-
0095-8956
- Source identifiers:
-
604679
Item Description
- Keywords:
- Pubs id:
-
pubs:604679
- UUID:
-
uuid:91edfafa-aecb-47da-a3fe-36b1d7d70f35
- Local pid:
- pubs:604679
- Deposit date:
- 2016-07-09
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2016
- Notes:
- This is an accepted manuscript of a journal article published by Elsevier in Journal of Combinatorial Theory, Series B on 2015-01-27, available online: http://dx.doi.org/10.1016/j.jctb.2016.01.003
If you are the owner of this record, you can report an update to it here: Report update to this record