![](/files/happy5.png)
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
.
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
Keywords: chromatic number
![Syndicate content Syndicate content](/misc/feed.png)