Approximate Graph Colouring and Crystals

DOI10.1137/1.9781611977554.CH86MaRDI QIDQ6414039zbMATH OpenOpenAlexFDO

Authors Lorenzo Ciardo, S. Zivny

Publication date 15 October 2022

Full work available at URL https://doi.org/10.1137/1.9781611977554.ch86

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Abstract: We show that approximate graph colouring is not solved by any level of the affine integer programming (AIP) hierarchy. To establish the result, we translate the problem of exhibiting a graph fooling a level of the AIP hierarchy into the problem of constructing a highly symmetric crystal tensor. In order to prove the existence of crystals in arbitrary dimension, we provide a combinatorial characterisation for realisable systems of tensors; i.e., sets of low-dimensional tensors that can be realised as the projections of a single high-dimensional tensor.

Cited in

(8)

• Promise and infinite-domain constraint satisfaction
• Quantum advantage and CSP complexity
• Approximate graph coloring and the crystal with a hollow shadow
• 1-in-3 vs. not-all-equal: dichotomy of a broken promise
• Quantum advantage and CSP complexity
• Semidefinite programming and linear equations vs. homomorphism problems
• 1-in-3 vs. not-all-equal: dichotomy of a broken promise
• The Sherali-Adams and Weisfeiler-Leman hierarchies in (promise valued) constraint satisfaction problems

This page was built for publication: Approximate Graph Colouring and Crystals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6414039)