Journal article icon

Journal article

TWO EXTENSIONS OF RAMSEY'S THEOREM

Abstract:

Ramsey's theorem, in the version of Erdo{double acute}s and Szekeres, states that every 2-coloring of the edges of the complete graph on {1,2,.,n} contains a monochromatic clique of order (1/2) log n. In this article, we consider two well-studied extensions of Ramsey's theorem. Improving a result of Rödl, we show that there is a constant c > 0 such that every 2-coloring of the edges of the complete graph on {2,3,.,n} contains a monochromatic clique S for which the sum of 1/log i over all v...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1215/00127094-2382566

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Sudakov, B More by this author
Journal:
DUKE MATHEMATICAL JOURNAL
Volume:
162
Issue:
15
Pages:
2903-2927
Publication date:
2013-12-01
DOI:
ISSN:
0012-7094
URN:
uuid:be3e165a-901b-43ca-b123-72883b5c23ef
Source identifiers:
252471
Local pid:
pubs:252471
Language:
English

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