- Abstract:
-
The Gy´arf´as-Sumner conjecture asserts that if H is a tree then every graph with bounded clique number and very large chromatic number contains H as an induced subgraph. This is still open, although it has been proved for a few simple families of trees, including trees of radius two, some special trees of radius three, and subdivided stars. These trees all have the property that their vertices of degree more than two are clustered quite closely together. In this paper, we prove the conjectur...
Expand abstract - Publication status:
- Published
- Peer review status:
- Peer reviewed
- Files:
-
-
(pdf, 0.0b)
-
- Publisher copy:
- 10.1002/jgt.22450
-
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.
- Publisher:
- Wiley Publisher's website
- Journal:
- Journal of Graph Theory Journal website
- Volume:
- 92
- Issue:
- 3
- Pages:
- 237-254
- Publication date:
- 2019-02-11
- Acceptance date:
- 2018-12-19
- DOI:
- EISSN:
-
1097-0118
- ISSN:
-
0364-9024
- Pubs id:
-
pubs:953280
- UUID:
-
uuid:c2452827-3632-4a7e-8997-e237897166a7
- Source identifiers:
-
953280
- Local pid:
- pubs:953280
- Copyright holder:
- Wiley Periodicals, Inc
- Copyright date:
- 2019
- Rights statement:
- © 2019 Wiley Periodicals, Inc.
- Notes:
- This is the accepted manuscript version of the article. The final version is available online from Wiley at: 10.1002/jgt.22450
Journal article
Induced subgraphs of graphs with large chromatic number. XII. Distant stars
Actions
Access Document
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
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
Funding
Bibliographic Details
Terms of use
Metrics
Altmetrics
Dimensions
If you are the owner of this record, you can report an update to it here: Report update to this record