Journal article
On two problems in graph Ramsey theory
- Abstract:
-
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices.
The Ramsey number r(H) of a graph H is the least positive integer N such that every two-coloring of the edges of the complete graph KN contains a monochromatic copy of H. A famous result of Chváatal, Rödl, Szemeré...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
- Version:
- Accepted manuscript
Actions
Access Document
- Files:
-
-
(pdf, 340.4KB)
-
- Publisher copy:
- 10.1007/s00493-012-2710-3
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:
- Springer Verlag (Germany) Publisher's website
- Journal:
- Combinatorica Journal website
- Volume:
- 32
- Issue:
- 5
- Pages:
- 513–535
- Publication date:
- 2012-10-04
- DOI:
- EISSN:
-
1439-6912
- ISSN:
-
0209-9683
- Pubs id:
-
pubs:196712
- URN:
-
uri:07950dc1-8ac3-4cb1-810e-154ec6e4c93b
- UUID:
-
uuid:07950dc1-8ac3-4cb1-810e-154ec6e4c93b
- Local pid:
- pubs:196712
Item Description
- Keywords:
Terms of use
- Copyright holder:
- János Bolyai Mathematical Society and Springer-Verlag
- Copyright date:
- 2012
- Notes:
-
This is the author accepted manuscript following peer review version of the article. The final version is
available online from Springer at: https://doi.org/10.1007/s00493-012-2710-3
If you are the owner of this record, you can report an update to it here: Report update to this record