Erdős Problem #986
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.
Exact FrontierDelta
Scope and record
Occurred: Oct 29, 2026
Delta type: REGISTRY REVISION
Assumptions: VibeMathed verification: site-confirmed. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.
Canonical aliases: Erdős Problem #986 · Erdős #986 · Problem 986
Confidence: Not scored
Registry verification: site confirmed · announcement · resolved
Attribution
VibeMathed
registry · event recorded by
Claude
model · ai model contributor
OpenAI internal model
model · ai model contributor
Domagoj Bradač
human · human collaborator
Lineage and corrections
Corrects Erdős Problem #986 →
Supersedes Erdős Problem #986 →
This event attributed to OpenAI internal model
Stronger result in the OpenAI math release evidence for this event
Erdős Problem #986 parent of this event
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. parent of this event
This event attributed to Claude
This event attributed to Domagoj Bradač
VibeMathed record: Erdős Problem #986 evidence for this event
Erdős Problem #986 evidence for this event
Act on this frontier