19 citations · 57 across the 10 of their papers we have counts for
1 paper · 1 filter
Konstantin Golubev
In [Ho] A.J. Hoffman proved a lower bound on the chromatic number of a graph in the terms of the largest and the smallest eigenvalues of its adjacency matrix. In this paper, we pro…