A Stress-Free Sum-of-Squares Lower Bound for Coloring

by   Pravesh K. Kothari, et al.

We prove that with high probability over the choice of a random graph G from the Erdős-Rényi distribution G(n,1/2), a natural n^O(ε^2 log n)-time, degree O(ε^2 log n) sum-of-squares semidefinite program cannot refute the existence of a valid k-coloring of G for k = n^1/2 +ε. Our result implies that the refutation guarantee of the basic semidefinite program (a close variant of the Lovász theta function) cannot be appreciably improved by a natural o(log n)-degree sum-of-squares strengthening, and this is tight up to a n^o(1) slack in k. To the best of our knowledge, this is the first lower bound for coloring G(n,1/2) for even a single round strengthening of the basic SDP in any SDP hierarchy. Our proof relies on a new variant of instance-preserving non-pointwise complete reduction within SoS from coloring a graph to finding large independent sets in it. Our proof is (perhaps surprisingly) short, simple and does not require complicated spectral norm bounds on random matrices with dependent entries that have been otherwise necessary in the proofs of many similar results [BHK+16, HKP+17, KB19, GJJ+20, MRX20]. Our result formally holds for a constraint system where vertices are allowed to belong to multiple color classes; we leave the extension to the formally stronger formulation of coloring, where vertices must belong to unique colors classes, as an outstanding open problem.


page 1

page 2

page 3

page 4


Lower Bound for (Sum) Coloring Problem

The Minimum Sum Coloring Problem is a variant of the Graph Vertex Colori...

A degree 4 sum-of-squares lower bound for the clique number of the Paley graph

We prove that the degree 4 sum-of-squares (SOS) relaxation of the clique...

Distributed Δ-Coloring Plays Hide-and-Seek

We prove several new tight distributed lower bounds for classic symmetry...

The spectrum of the Grigoriev-Laurent pseudomoments

Grigoriev (2001) and Laurent (2003) independently showed that the sum-of...

Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

Given a large data matrix A∈R^n× n, we consider the problem of determini...

Algorithms approaching the threshold for semi-random planted clique

We design new polynomial-time algorithms for recovering planted cliques ...

A Note on Property Testing Sum of Squares and Multivariate Polynomial Interpolation

In this paper, we investigate property testing whether or not a degree d...

Please sign up or login with your details

Forgot password? Click here to reset