Erdős Problem #986

Full solution by Domagoj Bradač with Claude and OpenAI internal model (16 Jun 2026).

Problem
Erdős problem #986 (graph theory, ramsey theory); current status: proved
Credit
Domagoj Bradač with Claude and OpenAI internal model · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-06-16 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
SOLVEDPer Tao's AI-contributions wiki

The problem

For any fixed s≥3s\geq 3,

R(s,k)≫ks−1(log⁡k)cR(s,k) \gg \frac{k^{s-1}}{(\log k)^c}

for some constant c=c(s)>0c=c(s)>0.

Statement quoted from erdosproblems.com/986, maintained by Thomas Bloom. Original source: [Er90b,p.18]. Current status there: proved.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome
27 May-16 Jun, 2026 AI working with humans Claude, OpenAI internal model Domagoj Bradač 🟢 Full solution

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎