  We show that approximate graph colouring is not solved by the
lift-and-project hierarchy for the combination of linear programming and linear
Diophantine equations. The proof is based on combinatorial tensor theory.
