Erdős·erdos:575
Erdős 575
No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.
A Palomar registration names this problem. It is shown below but not counted as a check of the claim.
Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
graph theory, turan number·Source
AI activity
How grades workDisproved: a finite family of connected bipartite graphs, each containing a cycle, with ex(n; G) ≫ n^(4/3) for every member but ex(n; F) ≪ n^(4/3 − 1/48) for the family.
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 finite family $\mathcal{F}$ of connected bipartite graphs, every member of which contains a cycle, such that\[\mathrm{ex}(n;G)\gg n^{4/3}\]for all $G\in \mathcal{F}$ and\[\mathrm{ex}(n;\mathcal{F})\ll n^{4/3-c}\]where $c=1/48$.
Paper identifying a misstatement to the problem found
Reasoning and sources
Autonomy
Secondary contribution: literature search
Sources
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
Checks
1-
verified·Palomar
Registered by Palomar at b135fd8f: Comparator confirmed 9 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel. The project names this problem, which does not establish that it proves the result claimed here, so it is not counted as a check of it
Declared by the projects
1As each project's formalization.yaml states it.
Erdős 575: bipartite extremal-graph compactness
- authors
- Linmiao Xu
- method
- agent
- review
- agent-reviewed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 9 main results named, checked with Comparator, with an alignment table
- sources
- Ten advances in mathematics and theoretical computer science — formalizes, authors not-contacted; The Erdős–Simonovits Compactness Conjecture Needs More Assumptions — formalizes, authors not-contacted; Compactness results in extremal graph theory — background, authors not-contacted; Erdős Problem 575: bipartite extremal-graph compactness — background
- related
- openai/ten-proofs/blob/94bc0feb6a9ff12c7d31d6de640a725c9d43d2b6/CompactnessAndDegeneracy.lean — extends; google-deepmind/formal-conjectures/issues/804 — adapts
- divergences
- None. Both the cycle-containing formulation (erdos_575 / CyclicBipartiteCompactnessStatement) and the literal unrestricted formulation (erdos_575_unrestricted / BipartiteCompactnessStatement) preserve the exact mixed-order finite-family quantifier, the ContainsBipartiteMember hypothesis, and the requirement that the controlling graph H in F be bipartite (IsBipartiteCompactFamily).
- checked by
- Palomar
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 · 0
No formal statement located.
Cited proofs · 0
No proof artifact cited by the formal record.
Recorded elsewhere
Compare the registries- palomar — Erdős 575: bipartite extremal-graph compactness
Also known as · 1
- https://www.erdosproblems.com/575
Cite this record
qed.bot, “Erdős 575”, https://qed.bot/s/erdos-575, as of 20 Nov 2026.