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) ≤ k- C k k 2kk.\]
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.