Publication

An improved upper bound for the multicolour Ramsey number of odd cycles

2026

Abstract

We show that the k -colour Ramsey number of an odd cycle of length 2 ℓ + 1 is at most ( 4 ℓ ) k ⋅ k k / ℓ . This proves a conjecture of Fox and is the first improvement in the exponent that goes beyond an absolute constant factor since the work of Bondy and Erdős from 1973.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

An improved upper bound for the multicolour Ramsey number of odd cycles

Chat with Graph Search

Some complexity results about threshold graphs