Source authenticated

The logarithmic exponent of the off-diagonal Ramsey numbers r(s,t) for fixed s at least 5

For every fixed s≥5s\ge5: there is CsC_s such that for every ε>0\varepsilon>0 and all large tt, ts−1/(log⁡t)s−2+ε≤r(s,t)≤Csts−1/(log⁡t)s−2t^{s-1}/(\log t)^{s-2+\varepsilon}\le r(s,t)\le C_s t^{s-1}/(\log t)^{s-2}, so r(s,t)=ts−1/(log⁡t)s−2+o(1)r(s,t)=t^{s-1}/(\log t)^{s-2+o(1)} and the classical upper bound is sharp up to (log⁡t)o(1)(\log t)^{o(1)}. The lower bound comes from a random ordered point-hyperplane flag graph in PG(s−1,q)\mathrm{PG}(s-1,q) (Bradac's construction) with a new entropy and compression analysis of its independent sets. It does NOT give r(s,t)=Θ(ts−1/(log⁡t)s−2)r(s,t)=\Theta(t^{s-1}/(\log t)^{s-2}), and it does not cover s=4s=4, where the gap between t3/(log⁡t)4t^3/(\log t)^4 and t3/(log⁡t)2t^3/(\log t)^2 remains.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 24, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. 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: The logarithmic exponent of the off-diagonal Ramsey numbers r(s,t) for fixed s at least 5 · Log exponent of r(s,t), s >= 5

Confidence: Not scored

Registry verification: lean checked · announcement · partial

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Artifacts and verifiers

Lean: OAI/Combinatorics/SharpRamsey/Main.lean (SharpLogRamsey.main, s >= 6)

lean artifact · pending

Artifact ↗
Lean: OAI/Combinatorics/RamseyFive/Main.lean (SharpRamseyFive.main, s = 5)

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

VibeMathed record: The logarithmic exponent of the off-diagonal Ramsey numbers r(s,t) for fixed s at least 5 evidence for this event

This event attributed to Unreleased internal OpenAI model

The sharp logarithmic exponent of r(5,t) (companion, s = 5) evidence for this event

For every fixed s≥5s\ge5: there is CsC_s such that for every ε>0\varepsilon>0 and all large tt, ts−1/(log⁡t)s−2+ε≤r(s,t)≤Csts−1/(log⁡t)s−2t^{s-1}/(\log t)^{s-2+\varepsilon}\le r(s,t)\le C_s t^{s-1}/(\log t)^{s-2}, so r(s,t)=ts−1/(log⁡t)s−2+o(1)r(s,t)=t^{s-1}/(\log t)^{s-2+o(1)} and the classical upper bound is sharp up to (log⁡t)o(1)(\log t)^{o(1)}. The lower bound comes from a random ordered point-hyperplane flag graph in PG(s−1,q)\mathrm{PG}(s-1,q) (Bradac's construction) with a new entropy and compression analysis of its independent sets. It does NOT give r(s,t)=Θ(ts−1/(log⁡t)s−2)r(s,t)=\Theta(t^{s-1}/(\log t)^{s-2}), and it does not cover s=4s=4, where the gap between t3/(log⁡t)4t^3/(\log t)^4 and t3/(log⁡t)2t^3/(\log t)^2 remains. parent of this event

The logarithmic exponent of the off-diagonal Ramsey numbers r(s,t) for fixed s at least 5 parent of this event

The logarithmic exponent of the off-diagonal Ramsey numbers r(s,t) for fixed s at least 5 evidence for this event

Lean: OAI/Combinatorics/RamseyFive/Main.lean (SharpRamseyFive.main, s = 5) evidence for this event

Lean: OAI/Combinatorics/SharpRamsey/Main.lean (SharpLogRamsey.main, s >= 6) evidence for this event

Erdős Problem #986 evidence for this event

Act on this frontier

Verify, challenge, or extend the result.