Strict vector coloring

A strict vector $k$-coloring requires equality $⟨v_i,v_j⟩=-1/(k-1)$ on every edge. The least admissible $k$ is the complement theta number for a graph with an edge. Allowing merely an inequality defines the potentially smaller vector chromatic number.