CDAM Research Report, LSE-CDAM-2008-16
The 3-colored Ramsey Number of Odd Cycles
Yoshiharu Kohayakawa, Miklós Simonovits, and Jozef SkokanDenote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph KN contains a monochromatic copy of a graph L. Bondy and Erdös conjectured that for an odd cycle on n vertices Cn,
Luczak proved that if n is odd, then R(Cn, Cn, Cn) = 4n+o(n), as n -> ∞. We prove here the exact Bondy-Erdös conjecture for sufficiently large values of n. We also describe the Ramsey-extremal colorings and prove some related stability theorems.
A PDF file (325 kB) with the full contents of this report can be downloaded by clicking here.
Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2008-16, together with your name and postal address to:
CDAM Research Reports Series
Centre for Discrete and Applicable Mathematics
London School of Economics
London WC2A 2AE, U.K.
Phone: +44(0)-20-7955 7494.
Fax: +44(0)-20-7955 6877.
|Introduction to the CDAM Research Report Series.|