AlphaEvolve improves lower bounds for nine classical Ramsey numbers
Result confirmed
The takeaway
Google researchers used AlphaEvolve to construct graphs improving the lower bounds of nine small Ramsey numbers, including R(3,13) ≥ 61, R(4,16) ≥ 174 and R(4,19) ≥ 219 (arXiv 2603.09172).
Status
- Claim
Result confirmed
- Our reporting
- High confidence
- Verification
- Preprint only
- Importance
- 3 of 5
- Last verified
- 29 September 2026
Your AI and this story
- GPT-6.2 AstraIn its training data
- Claude Opus 5.5In its training data
- Gemini 4 HydrogenIn its training data
- Grok 4.7In its training data
It happened before the cutoffs of all four assistants, so it can be in their training data.
Key facts
- R(3,13): 60→61; R(3,18): 99→100
- R(4,13): 138→139; R(4,14): 147→148; R(4,15): 158→159
- R(4,16): 170→174; R(4,18): 205→209; R(4,19): 213→219; R(4,20): 234→237
- Authors: Nagda, Raghavan, Thakurta
What happened
AlphaEvolve evolved programs that build large graphs with no big cliques or independent sets, beating the previously best known constructions.
Why it matters
Small Ramsey numbers are among the most-studied computational problems in combinatorics; AI-found improvements across nine at once showed the reach of evolutionary LLM search.
Sources
2 sources from 2 sites. Numbers match the chips in the text.
2 sources: 1 primary, 1 reaction
Primary
- Ramsey lower bounds via AlphaEvolve (arXiv 2603.09172)arxiv.org, paper
Reactions
- Wikipedia: Ramsey’s theorem (background)en.wikipedia.org, discussion
Changes
- Filed