Lower bounds for finite two-colour Ramsey numbers R(s,t)
Follow the latest progress by email.
The two-color Ramsey number R(s,t) is the least vertex count forcing an s-clique or an independent t-set. Lower bounds require graphs avoiding both; explicit constructions seek formulas as well as computer-found finite witnesses.
Why it matters and what counts as progress
Why it matters: New witnesses improve concrete Ramsey bounds, while algebraic constructions can provide families with controlled clique and independence numbers.
What counts as progress: A verified graph raising a listed R(s,t) lower bound, or a direct explicit family improving the relevant asymptotic comparison under the same construction model.
How the problem developed
- 21 Apr 2026 · Computational lower bounds [1]
Ansh Nagda, Prabhakar Raghavan and Abhradeep Thakurta Reported improved lower bounds for nine finite two-colour Ramsey numbers from computer-generated constructions.
- 22 Aug 2026 · Asymptotic lower bound [2]
Ferdinand Ihringer and Sam Mattheus Proved a uniform lower bound R(s,t)≥t^((1−o(1)) log s/log(log s+1)) for 3≤s≤t, including a stated improvement for R(33,t).
AI contributions 2
An improved algebraic construction for Ramsey numbers
ChatGPT 5.6 suggested the two-way trace graph TG_{d,h} of Remark 2.2 on projective points over F_(2^h). Ihringer and Mattheus bound its clique size by binom(d−2,ceil((d−2)/2)) and independence number by (d^h+1)². Their stronger one-way ordered graph and Theorem 1.3 are human-developed refinements.
Reinforced Generation of Combinatorial Structures: Ramsey Numbers
AlphaEvolve-generated graph searches report R(3,13)≥61, R(3,18)≥100, R(4,13)≥139, R(4,14)≥148, R(4,15)≥159, R(4,16)≥174, R(4,18)≥209, R(4,19)≥219 and R(4,20)≥237.
Sources
- Ansh Nagda, Prabhakar Raghavan and Abhradeep Thakurta, Reinforced Generation of Combinatorial Structures: Ramsey Numbers
- Ferdinand Ihringer and Sam Mattheus, An improved algebraic construction for Ramsey numbers
- Ramsey graph paper and AI declaration
- Ramsey construction listing
- Nagda, Raghavan and Thakurta’s Ramsey paper
- Released Ramsey matrices and verifier
Website timeline
Publication dates and editorial changes.
AlphaEvolve search reports nine improved Ramsey lower bounds