
Faber, Vance
Erdős–Faber–Lovász conjecture ★★★
Author(s): Erdos; Faber; Lovasz
Conjecture If
is a simple graph which is the union of
pairwise edge-disjoint complete graphs, each of which has
vertices, then the chromatic number of
is
.





Keywords: chromatic number
