Finite-convergence conjecture for the theta hierarchy of a graph
Statement
Let be a graph, let denote its stability number, and let denote the level- semidefinite parameter in the theta hierarchy.
Finite-convergence conjecture. For any graph ,
This is a weaker conjecture than the De Klerk–Pasechnik conjecture: it asks only for convergence at some finite level, without specifying the level. Finite convergence at any step is not known in general.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.