1 problem

Minimum semidefinite rank conjecture for graphs of large girth
Large-girth minimum semidefinite rank conjecture. If $G$ has girth at least $k$ , then
openFrom papersgirth graph-theory minimum-semidefinite-rank
0 responses
8

Minimum semidefinite rank conjecture for graphs of large girth