A lower bound on the Ramsey number R_k(k+1,k+1)
Abstract
We will prove that Rk(k +1,k +1) ≥ 4tw⌊k/4⌋−3(2), where tw is the tower function defined by tw1(x) = x and twi+1(x) = 2twi(x). We also give proofs of Rk(k+1,k+2) ≥ 4twk−7(2), Rk(k+1,2k+1) ≥ 4twk−3(2), and Rk(k+2,k+2) ≥ 4twk−4(2).
Fields of Study & Subjects
Limits and Structures in Graph Theory
Computability
Logic
AI Algorithms
Advanced Topology and Set Theory
Publication details
- Journal / source
- Advances in Combinatorics
- Publication date
- 25 March 2026
- Language
- EN