Erdős·erdos:593
Erdős Problem 593
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 an alignment table and written divergences.
set theory, graph theory, hypergraphs, chromatic number·Source
AI activity
How grades workCandidate full solution
Reasoning and sources
Autonomy
AI collaborating with humans
Sources
Claimed on erdosproblems.com
2Proof claims posted on erdosproblems.com, which says that listing a claim “is no guarantee of proof correctness”. The register records who claims what, with which systems, and links to each claim there. Nobody has examined them, and none counts in the register's totals.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through an alignment table and written divergences.
Checks
1-
verified·Palomar
Registered by Palomar at ea81bf26: Comparator confirmed 2 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 Problem 593: classification of obligatory triple systems
- method
- agent — OpenAI GPT-5 family
- review
- self-assessed — self-assessed and kernel-checked; not peer-reviewed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Obligatory Triple Systems: An Alternative Proof and Lean Verification — formalizes, authors participated; A Resolution of Erdős Problems 593 and 1177: Obligatory Triple Systems and Exact Spectra — background, authors not-contacted
- divergences
- This is not a line-by-line formalization of Eric Li's manuscript. It formalizes the alternative implementation in the cited Petkov source. In particular, it uses an explicit shift-graph realization of the required high-odd-girth host, while the written manuscript invokes the classical Erdős–Hajnal high-odd-girth theorem directly.
- 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 · 1
Cited proofs · 0
No proof artifact cited by the formal record.
Recorded elsewhere
Compare the registries- palomar — Erdős Problem 593: classification of obligatory triple systems
- vibemathed — Erdős Problem #593
- vibemathed — Erdos Problems #593 and #1177
Also known as · 3
- https://www.erdosproblems.com/593
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/593.lean
- FormalConjectures/ErdosProblems/593.lean
Cite this record
qed.bot, “Erdős Problem 593”, https://qed.bot/s/erdos-593, as of 20 Nov 2026.