
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
.



Keywords: coloring; complete bipartite graph; eigenvalues; interlacing
