The Complexity of 3-Colouring H-Colourable Graphs

We study the complexity of approximation on satisfiable instances for graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Nešetřil, this problem is NP-hard for any non-bipartite graph H. In the context of promise constraint satisfaction problems, Brakensiek and Guruswami conjectured that this hardness result extends to promise graph homomorphism as follows: fix any non-bipartite graph H and another graph G with a homomorphism from H to G, it is NP-hard to find a homomorphism to G from a given H-colourable graph. Arguably, the two most important special cases of this conjecture are when H is fixed to be the complete graph on 3 vertices (and G is any graph with a triangle) and when G is the complete graph on 3 vertices (and H is any 3-colourable graph). The former case is equivalent to the notoriously difficult approximate graph colouring problem. In this paper, we confirm the Brakensiek-Guruswami conjecture for the latter case. Our proofs rely on a novel combination of the universal-algebraic approach to promise constraint satisfaction, that was recently developed by Barto, Bulín and the authors, with some ideas from algebraic topology.

[1]  Amey Bhangale,et al.  Simplified inpproximability of hypergraph coloring via t-agreeing families , 2019, Electron. Colloquium Comput. Complex..

[2]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[3]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[4]  Venkatesan Guruswami,et al.  An Algorithmic Blend of LPs and Ring Equations for Promise CSPs , 2018, SODA.

[5]  Irit Dinur,et al.  The Hardness of 3-Uniform Hypergraph Coloring , 2005, Comb..

[6]  Stanislav Zivny,et al.  Improved hardness for H-colourings of G-colourable graphs , 2019, SODA.

[7]  Libor Barto,et al.  Robustly Solvable Constraint Satisfaction Problems , 2015, SIAM J. Comput..

[8]  L. Lovász,et al.  Applications of product colouring , 1974 .

[9]  Venkatesan Guruswami,et al.  (2+ε)-Sat Is NP-hard , 2014, SIAM J. Comput..

[10]  Venkatesan Guruswami,et al.  On the Hardness of 4-Coloring a 3-Colorable Graph , 2004, SIAM J. Discret. Math..

[11]  Venkatesan Guruswami,et al.  The Quest for Strong Inapproximability Results with Perfect Completeness , 2021, Electron. Colloquium Comput. Complex..

[12]  James W. Walker.  From graphs to ortholattices and equivariant maps , 1983, J. Comb. Theory, Ser. B.

[13]  Sangxia Huang,et al.  Improved Hardness of Approximating Chromatic Number , 2013, APPROX-RANDOM.

[14]  Libor Barto,et al.  Polymorphisms, and How to Use Them , 2017, The Constraint Satisfaction Problem.

[15]  ThorupMikkel,et al.  Coloring 3-Colorable Graphs with Less than n1/5 Colors , 2017 .

[16]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[17]  Nathan Linial,et al.  On the Hardness of Approximating the Chromatic Number , 2000, Comb..

[18]  Amey Bhangale,et al.  Improved Inapproximability of Rainbow Coloring , 2018, SODA.

[19]  R. Ho.  Algebraic Topology , 2022 .

[20]  Jakub Bulín,et al.  Algebraic approach to promise constraint satisfaction , 2018, STOC.

[21]  Venkatesan Guruswami,et al.  New Hardness Results for Graph and Hypergraph Colorings , 2016, CCC.

[22]  J. Matousek,et al.  Using The Borsuk-Ulam Theorem , 2007 .

[23]  Venkatesan Guruswami,et al.  Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy , 2018, SODA.

[24]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[25]  Venkatesan Guruswami,et al.  Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs , 2015, SODA.

[26]  Andrei A. Krokhin,et al.  The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) , 2018, Dagstuhl Reports.

[27]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[28]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[29]  Elchanan Mossel,et al.  Conditional hardness for approximate coloring , 2005, STOC '06.

[30]  Amey Bhangale.  NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors , 2018, Electron. Colloquium Comput. Complex..

[31]  Ken-ichi Kawarabayashi,et al.  Coloring 3-Colorable Graphs with Less than n1/5 Colors , 2017, J. ACM.