Multicolour Ramsey numbers of paths and even cycles

E. Davies, M. Jenssen, B. Roberts

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


We prove new upper bounds on the multicolour Ramsey numbers of paths and even cycles. It is well known that (k−1)n+o(n)≤Rk(Pn)≤Rk(Cn)≤kn+o(n). The upper bound was recently improved by Sárközy who showed that Rk(Cn)≤(k−(k/16k3+1))n+o(n). Here we show Rk(Cn)≤(k−¼)n+o(n), obtaining the first improvement to the coefficient of the linear term by an absolute constant.
Original languageEnglish
Pages (from-to)124-133
Number of pages10
JournalEuropean Journal of Combinatorics
Early online date30 Mar 2017
Publication statusPublished - Jun 2017


Dive into the research topics of 'Multicolour Ramsey numbers of paths and even cycles'. Together they form a unique fingerprint.

Cite this