For a proper three-graph colouring , associate the colors with the three roots of unity , viewed as unit vectors in . Define using the real inner product.
This is twice a Gram matrix, so it is a positive semidefinite matrix. Its diagonal is . On every edge, the endpoint colors differ, so their vectors make angle or and . Thus and this are feasible in the second semidefinite program, provingThis is the regular simplex construction of a strict vector coloring.
Articles by others on the same topic
There are currently no matching articles.