Erdős Problem #986
Erdős problem #986 · erdosproblems.com/986
- Result
- Proved(see note)
- Status
- Resolved
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Graph Theory, Ramsey Theory
- Posed by
- Paul Erdős
- Year posed
- 1990
- Years open
- 36y
- Solved
- 2026-06-16
- Model
- Claude, OpenAI internal model
- Vendor
- —
- Collaborators
- Domagoj Bradač
- Verification
- Site-confirmed
- Publication
- Announced
- Significance
- 11 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
For each fixed s >= 5, the OpenAI math release (September 2026) claims the sharper lower bound r(s,t) >= t^(s-1)/(log t)^(s-2+eps), matching the Ajtai-Komlos-Szemeredi upper bound in the logarithmic exponent up to (log t)^o(1); see off-diagonal-ramsey-log-exponent.
Verification
Marked solved by erdosproblems.com's official status. Solve credited via Terence Tao's AI-contributions wiki.
Sources
- Problem recorderdosproblems.com
- OtherStronger result in the OpenAI math release