Approximate Graph Colouring and the Hollow Shadow

11/06/2022
by   Lorenzo Ciardo, et al.
0

We show that approximate graph colouring is not solved by constantly many levels of the lift-and-project hierarchy for the combined basic linear programming and affine integer programming relaxation. The proof involves a construction of tensors whose fixed-dimensional projections are equal up to reflection and satisfy a sparsity condition, which may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2022

Approximate Graph Colouring and Crystals

We show that approximate graph colouring is not solved by any level of t...
research
07/03/2020

The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains

Convex relaxations have been instrumental in solvability of constraint s...
research
03/04/2022

The Sherali-Adams Hierarchy for Promise CSPs through Tensors

We study the Sherali-Adams linear programming hierarchy in the context o...
research
05/10/2022

Weisfeiler-Leman Invariant Promise Valued CSPs

In a recent line of work, Butti and Dalmau have shown that a fixed-templ...
research
06/10/2020

Least-Squares Affine Reflection Using Eigen Decomposition

This note summarizes the steps to computing the best-fitting affine refl...
research
07/08/2021

An Integer Linear Programming Model for Tilings

In this paper, we propose an Integer Linear Model whose solutions are th...
research
10/01/2022

Closed cap condition under the cap construction algorithm

Every polygon P can be companioned by a cap polygon P̂ such that P and P...

Please sign up or login with your details

Forgot password? Click here to reset