qedbot

Erdős·erdos:1017

Erdős Problem 1017

conjecture formal record: open source: open F2 declared

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·Source

AI activity

How grades work

No AI contribution recorded against this statement.

F2 declared. The correspondence is declared through an alignment table and written divergences.

declares divergences from its source reviewed by its authors only

Checks

1
  • verified·Palomar

    Registered by Palomar at cf808826: Comparator confirmed 1 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

    project registered at a pinned commit·2026-11-11·commit cf808826d555

    PALOMAR-2026-11-11-000003 — names this problem; not counted as a check of the claim

Declared by the projects

1

As each project's formalization.yaml states it.

Erdős Problem 1017: clique partitions of graphs of given sizeplasma-ai/erdos-1017 · joined by names · Palomar

Read formalization.yaml

authors
Ryan Pettry
method
agent — claude-opus-5-5, gpt-6-astra, gpt-6.1-sol
review
self-assessed
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
sources
Erdős Problem #1017 — background; Formal Conjectures: ErdosProblems/1017.lean — background; Some unsolved problems in graph theory and combinatorial analysis — background; The representation of a graph by set intersections — background
divergences
Erdős asked whether the Erdős–Goodman–Pósa bound can be sharpened for k > n²/4, and Bloom's catalog asks for an estimate of f(n, k) there. The compared theorem makes this precise as a uniform additive asymptotic, f(n, k) = n² B(k/n²) + o(n²) over all 0 ≤ k ≤ n(n − 1)/2, with densities normalized by n² rather than by n(n − 1)/2. f is formal-conjectures' definition: the least m such that every graph on Fin n with exactly k edges has a partition of its edges into at most m cliques with at least two vertices each. For k ≤ n(n − 1)/2 this is the largest clique partition number among such graphs; for larger k it is 0, and the theorem does not use those values. In Challenge.lean the roots σ_d and z_c and the inverses of the mixed and two-head families are defined as infima of their exact algebraic solution sets in the stated intervals; the development proves that these are the unique roots and inverses and that B is continuous on [0, 1/2]. The blueprint follows the route of the Lean proof.
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 0

No proof artifact cited by the formal record.

Also known as · 3
  • https://www.erdosproblems.com/1017
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/1017.lean
  • FormalConjectures/ErdosProblems/1017.lean

Cite this record

qed.bot, “Erdős Problem 1017”, https://qed.bot/s/erdos-1017, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.