Skip to main content
Article thumbnail
Location of Repository

The 3-colored Ramsey number of odd cycles

By Yoshiharu Kohayakawa, Miklós Simonovits and Jozef Skokan

Abstract

For graphs L1, . . . ,Lk, the Ramsey number R(L1, . . . ,Lk) is the minimum integer N satisfying that for any coloring of the edges of the complete graph KN on N vertices by k colors there exists a color i for which the corresponding color class contains Li as a subgraph. In 1973, Bondy and Erd˝os conjectured that if n is odd and Cn denotes the cy- cle on n vertices, then R(Cn,Cn,Cn) = 4n − 3. In 1999, Luczak proved that R(Cn,Cn,Cn) = 4n + o(n), where o(n)/n ! 0 as n ! 1. In this paper we strengthen Luczak’s result and verify this conjecture for n sufficiently large

Topics: QA Mathematics
Publisher: Elsevier
Year: 2005
DOI identifier: 10.1016/j.endm.2005.05.053
OAI identifier: oai:eprints.lse.ac.uk:5820
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.sciencedirect.com/s... (external link)
  • http://eprints.lse.ac.uk/5820/ (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.