Spectral lower bounds for the quantum chromatic number of a graph. II (Q2215470): Difference between revisions

Summary: \textit{A. J. Hoffman} [in: Graph Theory Appl., Proc. advanced Sem. Wisconsin, Madison 1969, 79--91 (1970; Zbl 0221.05061)] proved that a graph \(G\) with eigenvalues \(\mu_1 \geqslant \cdots \geqslant \mu_n\) and chromatic number \(\chi(G)\) satisfies: \[ \chi \geqslant 1 + \kappa,\] where \(\kappa\) is the smallest integer such that \[\mu_1 + \sum_{i=1}^{\kappa} \mu_{n+1-i} \leqslant 0.\] We strengthen this well known result by proving that \(\chi(G)\) can be replaced by the quantum chromatic number, \( \chi_q(G)\), where for all graphs \(\chi_q(G) \leqslant \chi(G)\) and for some graphs \(\chi_q(G)\) is significantly smaller than \(\chi(G)\). We also prove a similar result, and investigate implications of these inequalities for the quantum chromatic number of various classes of graphs, which improves many known results. For example, we demonstrate that the Kneser graph \(KG_{p,2}\) has \(\chi_q = \chi = p - 2\). \par For Part I see [\textit{C. Elphick} and \textit{P. Wocjan}, J. Comb. Theory, Ser. A 168, 338--347 (2019; Zbl 1421.05042)].