1 research outputs found
New upper bound for multicolor Ramsey number of odd cycles
Let be the -color Ramsey number of an odd cycle
of length . It is shown that for each fixed ,
for all sufficiently large , where
is a constant.
This improves an old result by Bondy and Erd\H{o}s (Ramsey numbers for cycles
in graphs, J. Combin. Theory Ser. B 14 (1973) 46-54).Comment: 6 page