Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Suppose we have a complete graph $G$ of size $n$. What is the minimum number of complete graph of size $k, (k<n)$$k, k<n$ needed to cover all edges of the graph $G$? Are there any results related to this problem?
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?
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 edges of the graph $G$? Are there any results related to this problem?
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?
