GPT-6 Astra finds a proof improving the Kővári–Sós–Turán bound
Diagonal bipartite Ramsey numbers b(t,t) = O(2^t) (Mubayi)
Event confirmedAwaiting review
The takeaway
On Sept 26, 2026 Dhruv Mubayi posted a proof that every bipartite graph with N vertices per side and at least N²/2 edges contains K_{t,t} once N ≥ c·2^t.
Status
- Claim
Event confirmedAwaiting review
- Our reporting
- High confidence
- Verification
- Preprint only
- Importance
- 3 of 5
- Last verified
- 1 October 2026
Your AI and this story
- GPT-6.2 Astra118 days after its cutoff
- Claude Opus 5.588 days after its cutoff
- Gemini 4 Hydrogen179 days after its cutoff
- Grok 4.7118 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 88 days before it.
Key facts
- arXiv 2609.32937 (math.CO), Dhruv Mubayi, ‘Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds’, Sept 26, 2026
- Result: density ≥ 1/2 bipartite graphs contain K_{t,t} when N ≥ c·2^t; hence b(t,t) = O(2^t), improving Conlon’s O(2^t log t)
- AI declaration: ‘The proof of the main result was found by GPT-6 Astra after several guided prompts by the author. Astra first produced a proof that was only 8 pages long and was incomprehensible to the author’; later write-ups are largely the author’s
- Mubayi had earlier prompted Astra to extensions of the Erdős–Sós work (see GPT-6 Astra proves the Erdős–Sós conjecture with a short counting argument)
What happened
Mubayi, a leading extremal combinatorialist, reports that GPT-6 Astra found a proof removing the log factor from the best bound on diagonal bipartite Ramsey numbers. The improvement over the 1954 Kővári–Sós–Turán counting bound comes from a new method that he says “will probably have further applications”.
Why it matters
It is a quantitative improvement on a classical bound in a central area, credited outright to a model in the abstract. That kind of disclosure was rare before September 2026.
What is disputed or not yet verified
| Verification | Unrefereed preprint |
|---|
Sources
1 source from 1 site. Numbers match the chips in the text.
1 source: 1 primary
Primary
Changes
- Filed