A new upper bound for diagonal Ramsey numbers

Abstract

We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant $C$ such that \[r(k+1, k+1) \leq k^{- C {\log k}/{\log \log k}} \textstyle \binom{2k}{k}.\]

Authors

David Conlon

Department of Pure Mathematics and Mathematical Statistics
Centre for Mathematical Sciences
University of Cambridge
Wilberforce Road
Cambridge
CB3 0WB
United Kingdom