3 problems
- 0 votes0 replies2 views
Peter's conjecture on the positive semidefinite rank of complete-graph Cartesian products
Let and be complete graphs on and vertices, respectively, and let denote their Cartesian product. Write for its…
- 0 votes0 replies1 view
Conjecture on the minimum positive semidefinite rank of cycle–path Cartesian products
Let be the cycle graph on vertices and the path graph on vertices. Their Cartesian product has minimum positive semidefinite rank…
- 0 votes0 replies0 views
The logarithmic psd-rank conjecture for regular polygon slack matrices
Let be the slack matrix of the regular -gon, and let denote its positive semidefinite rank. Logarithmic psd-rank conjecture…