Girth-reducibility and the algorithmic barrier for coloring

04/05/2020
by   Fotis Iliopoulos, et al.
0

All known efficient algorithms for constraint satisfaction problems are stymied by random instances. For example, no efficient algorithm is known that can q-color a random graph with average degree (1 + ϵ)q ln q, even though random graphs remain q-colorable for average degree up to (2-o(1)) q ln q. Similar failure to find solutions at relatively low constraint densities is known for random CSPs such as random k-SAT and other hypergraph-based problems. The constraint density where algorithms break down for each CSP is known as the "algorithmic barrier" and provably corresponds to a phase transition in the geometry of the space of solutions [Achlioptas and Coja-Oghlan 2008]. In this paper we aim to shed light on the following question: Can algorithmic success up to the barrier for each CSP be ascribed to some simple deterministic property of the inputs? We answer this question positively for graph coloring by identifying the property of girth-reducibility. We prove that every girth-reducible graph of average degree (1-o(1) )q ln q is efficiently q-colorable and that the threshold for girth reducibility of random graphs coincides with the algorithmic barrier. Thus, we link the tractability of graph coloring up to the algorithmic barrier to a single deterministic property. Our main theorem actually extends to coloring k-uniform hypergraphs. As such, we believe that it is an important first step towards discovering the structural properties behind the tractability of arbitrary k-CSPs for constraint densities up to the algorithmic barrier.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2020

Breaking the 2^n barrier for 5-coloring and 6-coloring

The coloring problem (i.e., computing the chromatic number of a graph) c...
research
11/21/2022

Algorithmic Applications of Hypergraph and Partition Containers

We present a general method to convert algorithms into faster algorithms...
research
11/21/2019

The asymptotics of the clustering transition for random constraint satisfaction problems

Random Constraint Satisfaction Problems exhibit several phase transition...
research
03/29/2022

Algorithms and Barriers in the Symmetric Binary Perceptron Model

The symmetric binary perceptron () exhibits a dramatic statistical-to-co...
research
02/25/2021

Random hypergraphs and property B

In 1964 Erdős proved that (1+1)) ln(2)/4 k^2 2^k edges are sufficient to...
research
06/03/2021

The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials

Let Φ be a uniformly random k-SAT formula with n variables and m clauses...
research
07/06/2022

From algorithms to connectivity and back: finding a giant component in random k-SAT

We take an algorithmic approach to studying the solution space geometry ...

Please sign up or login with your details

Forgot password? Click here to reset