Erdős·erdos:146
Erdős Problem 146
Machine-checked by qed.bot.
Fidelity F2: The statement corpus cites this proof against its own statement.
graph theory, turan number·Source
AI activity
How grades workDisproved: a connected bipartite 2-degenerate graph H with ex(n; H) ≫ n^(3/2 + c) for some constant c > 0.
Reasoning and sources
Autonomy
The page credits an internal model at OpenAI and does not say how it was directed.
Details
attribution: This was disproved by an internal model at OpenAI, which constructed a connected bipartite $2$-degenerate $H$ such that\[\mathrm{ex}(n;H)\gg n^{3/2+c}\]for some constant $c>0$.
Fidelity
How fidelity is gradedF2 declared. The statement corpus cites this proof against its own statement.
Checks
1-
verified·qed.bot
656 theorems on the standard axioms only
Declared by the projects
1As each project's formalization.yaml states it.
ten-proofs
- authors
- OpenAI
- method
- agent — Astra (OpenAI)
- review
- agent-reviewed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 12 main results named, checked with Comparator
- sources
- Ten Advances in Mathematics and Theoretical Computer Science
- checked by
- qed.bot
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Recorded elsewhere
Compare the registries- vibemathed — Erdős Problem #146: Degeneracy Conjecture
Also known as · 3
- https://www.erdosproblems.com/146
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/146.lean
- FormalConjectures/ErdosProblems/146.lean
Cite this record
qed.bot, “Erdős Problem 146”, https://qed.bot/s/erdos-146, as of 20 Nov 2026.