Tales of Hoffman: from a distance

Aida Abiad, Jan Meeus

Hoffman proved that a graph $G$ with adjacency eigenvalues ${\lambda }_1\ge \cdots \ge {\lambda }_n$ and chromatic number $\chi (G)$ satisfies $\chi (G)\ge 1+\kappa ,$ where $\kappa$ is the smallest integer such th…