Journal article icon

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:
Publisher copy:
10.1007/s00493-012-2710-3

Authors


More by this author
Institution:
University of Oxford
Oxford college:
Wadham College
Department:
Oxford, MPLS, Mathematical Institute
Sudakov, B More by this author
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
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP