DeepAI AI Chat
Log In Sign Up

Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs

by   Jess Banks, et al.

We prove that in sparse Erdős-Rényi graphs of average degree d, the vector chromatic number (the relaxation of chromatic number coming from the Lovàsz theta function) is typically 12√(d) + o_d(1). This fits with a long-standing conjecture that various refutation and hypothesis-testing problems concerning k-colorings of sparse Erdős-Rényi graphs become computationally intractable below the `Kesten-Stigum threshold' d_KS,k = (k-1)^2. Along the way, we use the celebrated Ihara-Bass identity and a carefully constructed non-backtracking random walk to prove two deterministic results of independent interest: a lower bound on the vector chromatic number (and thus the chromatic number) using the spectrum of the non-backtracking walk matrix, and an upper bound dependent only on the girth and universal cover. Our upper bound may be equivalently viewed as a generalization of the Alon-Boppana theorem to irregular graphs


page 1

page 2

page 3

page 4


Another approach to non-repetitive colorings of graphs of bounded degree

We propose a new proof technique that aims to be applied to the same pro...

On a tracial version of Haemers bound

We extend upper bounds on the quantum independence number and the quantu...

Pushable chromatic number of graphs with degree constraints

Pushable homomorphisms and the pushable chromatic number χ_p of oriented...

A lower bound on the saturation number, and graphs for which it is sharp

Let H be a fixed graph. We say that a graph G is H-saturated if it has n...

How Well Do Local Algorithms Solve Semidefinite Programs?

Several probabilistic models from high-dimensional statistics and machin...

On the cover time of dense graphs

We consider arbitrary graphs G with n vertices and minimum degree at lea...

Average-Case Integrality Gap for Non-Negative Principal Component Analysis

Montanari and Richard (2015) asked whether a natural semidefinite progra...