![](/files/happy5.png)
Saks, Michael
Alon-Saks-Seymour Conjecture ★★★
Author(s): Alon; Saks; Seymour
Conjecture If
is a simple graph which can be written as an union of
edge-disjoint complete bipartite graphs, then
.
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ m $](/files/tex/ddaab6dc091926fb1da549195000491cefae85c1.png)
![$ \chi(G) \le m+1 $](/files/tex/0aefe0f752ac272776eec5c61c7d1a1822a3d224.png)
Keywords: coloring; complete bipartite graph; eigenvalues; interlacing
![Syndicate content Syndicate content](/misc/feed.png)