Erdős·erdos:111
Erdős Problem 111
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, set theory·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 de72caf0: Comparator confirmed 3 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 111: bipartizing finite subgraphs of uncountably chromatic graphs
- authors
- Jacob Parish
- method
- agent — claude-opus-5-5, gpt-6-astra
- review
- self-assessed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Erdős Problem #111 — background; On the combinatorial problems which I would most like to see solved — background; On almost bipartite large chromatic graphs — background; Some problems on finite and infinite graphs — background
- related
- google-deepmind/formal-conjectures/pull/3785 — independent; google-deepmind/formal-conjectures/pull/6635 — independent
- divergences
- No known divergence from the question affects the results. h G n is the supremum, over subgraphs H of G with n vertices, of the least number of edges of H whose deletion leaves H bipartite (IsBipartite); it is 0 when G has fewer than n vertices, which does not occur for the graphs concerned. Erdős, Hajnal and Szemerédi (1982, Definition 3.1) maximize over induced subgraphs instead; the values agree, because deleting edges from a subgraph never raises its bipartization number. The n = 0 term of h G n / n is 0 / 0 = 0, which does not affect the limit. bipartizationNumber is 0 for a subgraph with infinitely many edges, because Set.ncard of an infinite set is 0; the statements apply it only to subgraphs with finitely many vertices. The chromatic number is the least cardinality of a color set in the universe of the vertex type. The finite-density form of the question in Erdős (1981) asks, for G of chromatic number at least ℵ₁, that h_G(n)/n be unbounded: tendsto_of_not_countably_colorable has the same hypothesis and a stronger conclusion, and countably_colorable_of_linear is the contrapositive of that form. h and chromaticCardinal equal formal-conjectures' maxSubgraphEdgeDistToBipartite
- 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.
Also known as · 3
- https://www.erdosproblems.com/111
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/111.lean
- FormalConjectures/ErdosProblems/111.lean
Cite this record
qed.bot, “Erdős Problem 111”, https://qed.bot/s/erdos-111, as of 20 Nov 2026.