Gvozdenović–Laurent bound for the copositive stability-number hierarchy
Statement
Let be a graph, let be its order- copositive hierarchy bound, and let denote the vertices adjacent to or equal to a stable set . For every stable set with , the graph is obtained by deleting . The Gvozdenović–Laurent bound. For every ,
The source states that this conjecture implies the main convergence conjecture. Its general validity is not established in the supplied text.
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.