Suppose we have a complete graph $G$ of size $n$. What is the minimum number of complete graph of size $k, (k<n)$ needed to cover all the graph $G$? Are there any results related to this problem?