Spectral Lower Bounds for the Quantum Chromatic Number of a Graph -- Part II

Pawel Wocjan, Clive Elphick, Parisa Darbari

Hoffman proved that a graph $G$ with eigenvalues ${\mu }_1\ge \dots \ge {\mu }_n$ and chromatic number $\chi (G)$ satisfies: \[ χ\ge 1 + κ\] where $\kappa$ is the smallest integer such that \[ μ_1…