4
votes
1answer
365 views

Vector chromatic number and Lovasz theta

For $\alpha \ge 2$, an $\alpha$-vector coloring of a graph $X$ is an assignment of unit vectors to the vertices of $X$ such that vectors assigned to adjacent vertices have inner product less than or ...
1
vote
1answer
296 views

minimum rank - lovasz function inequality

hey, does the following inequality holds for every graph? $d(G)\geq\theta(G)$ while $\theta$ is the lovasz theta function and $d(G)$ is the minimum rank over all the matrices that represent the ...