What was already known
Erdős, Goodman and Pósa proved ≤ floor() in 1966. Below that edge threshold . Erdős’s 1971 question asks for sharper estimates above it.
AI involvement
The project credits GPT-6.1 Sol, GPT-6 Astra and Claude Opus 5.5 with finding the candidate function, dual certificates and the upper-bound argument. Humans directed the project and checked the statement. The manuscript credits Plasma AI as author.
Importance
The formula gives an asymptotic answer at every edge density, including the dense regime asked about in Erdős Problem 1017.
Technical verification
The project reports Lean 4 verification and acceptance by five kernels through Comparator on macOS without sandboxing. The checked statement is the uniform asymptotic formula. The paper presents only part of the case analysis; the full argument is in Lean.
Formal checking
The project reports Lean 4 verification and acceptance by five kernels through Comparator on macOS without sandboxing. The checked statement is the uniform asymptotic formula. The paper presents only part of the case analysis; the full argument is in Lean.
- Checker
- Lean and the five Comparator kernels, as reported by Plasma AI
- Scope
- Let be the largest minimum clique-partition size among simple graphs with n vertices and k edges. Plasma AI reports , uniformly for , with an explicit continuous piecewise algebraic function B.
- Basis
- Reported by the linked checker
- Theorem scope, AI provenance and kernel checksChecking scope
Human understanding
The manuscript and project review are attributed to Plasma AI and its agents. A separately attributed human explanation of the complete upper-bound argument is not documented.
Correction and publication history
New research with documented central AI work and completed checking evidence.
Read this published revision