New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix

Abstract

The purpose of this article is to improve existing lower bounds on the chromatic number χ. Let µ 1 , . . . , µ n be the eigenvalues of the adjacency matrix sorted in nonincreasing order.First, we prove the lower bound. . , n − 1. This generalizes the Hoffman lower bound which only involves the maximum and minimum eigenvalues, i.e., the case m = 1. We provide several examples for which the new bound exceeds the Hoffman lower bound.Second, we conjecture the lower bound χ ≥ 1 + S + /S − , where S + and S − are the sums of the squares of positive and negative eigenvalues, respectively. To corroborate this conjecture, we prove the weaker bound χ ≥ S + /S − . We show that the conjectured lower bound is tight for several families of graphs. We also performed various searches for a counter-example, but none was found.Our proofs rely on a new technique of converting the adjacency matrix into the zero matrix by conjugating with unitary matrices and use majorization of spectra of self-adjoint matrices.We also show that the above bounds are actually lower bounds on the normalized orthogonal rank of a graph, which is always less than or equal to the chromatic number. The normalized orthogonal rank is the minimum dimension making it possible to assign vectors with entries of modulus one to the vertices such that two such vectors are orthogonal if the corresponding vertices are connected.All these bounds are also valid when we replace the adjacency matrix A by W * A where W is an arbitrary self-adjoint matrix and * denotes the Schur product, that is, entrywise product of W and A.

Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph

“…q are integers, χ f is rational but it is unknown if ξ f is necessarily always rational. These hierarchies of parameters resolve a question raised by Wocjan and Elphick (see Section 2.4 of [22]) of whether…”

A characterization and an application of weight-regular partitions of graphs

“…When equality holds we call the coloring a Hoffman coloring. Recently, there has been some studies on finding reasonable lower bounds of χ(G) and on extending Hoffman's bound [2,7,19].…”

An Inertial Lower Bound for the Chromatic Number of a Graph

“…Note that for regular graphs, all of these bounds equal n/(n − d). Wocjan and Elphick [15] noted that 2m 2m − s + ≤ ω(G).…”

“…2 Replacing µ 2 with s + Edwards and Elphick [5] proved that 2m 2m − µ 2 ≤ χ(G) and Ando and Lin [1] proved a conjecture due to Wocjan and Elphick [15] that…”