Erdős Problem 1017

### What is the conjecture

https://www.erdosproblems.com/1017

Let $f(n,k)$ be such that every graph on $n$ vertices and $k$ edges can be partitioned into at most $f(k)$ edge-disjoint complete graphs. Estimate $f(n,k)$ for $k>n^2/4$.

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

Read the linked Erdős Problems page for the precise statement and status, then inspect the formal-conjectures repository's existing graph-theory conjectures and contribution conventions. Done means adding a Lean formalization of Problem 1017 that matches the conjecture and repository style.

Written by the indexing model from the issue text.