Erdős·erdos:919
Erdős 919
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.
graph theory, chromatic number·Source
AI activity
How grades workNo AI contribution recorded against this statement.
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 b1aababb: Comparator confirmed 4 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.
Reductions for Erdős Problem 919
- authors
- Manan Gupta
- method
- copilot
- review
- self-assessed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- ZFC reductions of Erdős Problem 919 to Problem 918(i) and to countable chromatic compactness at aleph_2, by a general blow-up construction — other; Problems and results in chromatic graph theory — background, authors n/a; On chromatic number of infinite graphs — other, authors n/a; Erdős Problem 919 — background, authors not-contacted
- related
- mnn31/erdos-lean/blob/e7de340be9c1828da18538feb254ee9dfcf3af42/ErdosLean/Erdos919.lean — supersedes; google-deepmind/formal-conjectures/pull/7250 — other
- divergences
- Mathlib has no chromatic cardinal of a graph, so Challenge.lean defines SimpleGraph.chromaticCardinal, with the same definition as formal-conjectures. Problem 918(i) is written out in the first equivalence, since this project does not import formal-conjectures. The page states the problem for subgraphs and the Lean statements use induced subgraphs. For an upper bound on the chromatic number these agree.
- 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.
Also known as · 1
- https://www.erdosproblems.com/919
Cite this record
qed.bot, “Erdős 919”, https://qed.bot/s/erdos-919, as of 20 Nov 2026.