Id: palomar/PALOMAR-2026-11-11-000003 Url: https://github.com/plasma-ai/erdos-1017/tree/cf808826d555289332becdf4fd86de962ca00dfa Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-11-000003-v1.json Repo: https://github.com/plasma-ai/erdos-1017 Tags: math.CO, msc:05C35, msc:05C70 Score: 0 Title: Erdős Problem 1017: clique partitions of graphs of given size Trust: high Domain: math.CO Source: palomar Authors: Ryan Pettry Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-11 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-11-000003 A Lean proof that f(n, k), the least number such that the edges of every graph with n vertices and k edges can be partitioned into at most f(n, k) cliques, satisfies f(n, k) = n² B(k/n²) + o(n²) uniformly in 0 ≤ k ≤ n(n − 1)/2, for an explicit continuous piecewise-algebraic function B on [0, 1/2]. B(d) = d for d ≤ 1/4; above 1/4 it is the larger of two curves built from explicit dual certificates on split, mixed and two-head graphs. This provides an asymptotic resolution of Erdős Problem 1017, as posed by Erdős and as stated by Bloom, who asks for an estimate of f(n, k) for k > n²/4. The…