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

Please sign up or login with your details

Forgot password? Click here to reset