The comparison conjecture for the SDP bound and the generalized Schrijver bound
Statement
Let be a graph and let . Denote by the upper bound defined by the SDP relaxation in, and by the upper bound defined in.
Comparison conjecture. The upper bound is at least as good as the upper bound .
For , the authors established that , where is the Schrijver number. They report numerical evidence for the comparison when , but were unable to establish it; its status is therefore open.
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.