论文标题
大约图形着色和带有空心阴影的晶体
Approximate Graph Colouring and the Crystal with a Hollow Shadow
论文作者
论文摘要
我们表明，对于线性编程和线性双方方程的组合，提升和项目的层次结构无法解决近似图的着色。证明基于组合张量理论。
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.
