New upper bound for multicolor Ramsey number of odd cycles

2015/06/14 by Lin, Qizhong, Chen, Weiji
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1506.04348

Abstract

Let r_k(C_2m+1) be the k-color Ramsey number of an odd cycle C_2m+1 of length 2m+1. It is shown that for each fixed m≥2, \[r_k(C_2m+1)0 is a constant. This improves an old result by Bondy and Erdős (Ramsey numbers for cycles in graphs, J. Combin. Theory Ser. B 14 (1973) 46-54).

Related

• Multicolour Ramsey Numbers of Odd Cycles
• An improved upper bound for the multicolour Ramsey number of odd cycles
• On the Multi-coloured Ramsey Numbers of Cycles
• Exact Ramsey numbers of odd cycles via nonlinear optimisation
• A note on multicolor Ramsey number of small odd cycles versus a large clique