Approximate graph colouring and crystals
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 o...
| Hlavní autoři: | , |
|---|---|
| Médium: | Conference item |
| Jazyk: | English |
| Vydáno: |
Society for Industrial and Applied Mathematics
2023
|