3 problems
3-sum conjecture. The invariant satisfies
Let and be two graphs with vertex sets … Let and be the primal-dual solution pairs to the max-cut SDPs on and , respectively. Let …
-sum embedding conjecture. For any family of graphs , we have
3-sum conjecture. The invariant satisfies
Let and be two graphs with vertex sets … Let and be the primal-dual solution pairs to the max-cut SDPs on and , respectively. Let …
-sum embedding conjecture. For any family of graphs , we have