Clique partitions above the Turán threshold
A clique is a set of mutually adjacent vertices in a graph. A clique partition divides all edges into cliques without overlap. Among graphs with n vertices and k edges, how large can the smallest such partition be?
Why it matters and what counts as progress
Why it matters: Erdős, Goodman and Pósa proved that at most floor() cliques always suffice. Erdős asked how this bound improves when a graph has more than edges.
What counts as progress: Determine the worst-case partition size as a function of both n and k. An asymptotic formula should state its error and whether it holds uniformly as the edge density varies.
How the problem developed
Paul Erdős, A. W. Goodman and Lajos Pósa Proved that every n-vertex graph admits a partition into at most floor() cliques.
Paul Erdős Asked for a sharper estimate when the number of edges exceeds .
Plasma AI Registered a Lean-checked formula for the worst-case partition size at every edge density.
AI contribution
An asymptotic formula for clique partitions above the Turán threshold
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.
Sources
Publication history
An asymptotic formula for clique partitions above the Turán threshold
Daily emails by default, only when there’s an update.