66 citations · 544 across the 74 of their papers we have counts for
1 paper · 2 filters
David Conlon
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 \frac{\log k}{\log \log k}} \binom{2…