ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let k≥2k\geq 2. Denote by θk3(G)\theta^3_k(G) the upper bound defined by the SDP relaxation in, and by ϑk′(G)\vartheta'_k(G) the upper bound defined in.

Comparison conjecture. The upper bound θk3(G)\theta^3_k(G) is at least as good as the upper bound ϑk′(G)\vartheta'_k(G).

For k=1k=1, the authors established that θk3(G)=ϑ′(G)\theta^3_k(G)=\vartheta'(G), where ϑ′(G)\vartheta'(G) is the Schrijver number. They report numerical evidence for the comparison when k>1k>1, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.