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}.\]
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}.\]