ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let α(G)\alpha(G) denote its stability number, and let ϑ(r)(G)\vartheta^{(r)}(G) denote the level-rr semidefinite parameter in the theta hierarchy.

Finite-convergence conjecture. For any graph GG,

ϑ(r)(G)=α(G)for some r∈N.\vartheta^{(r)}(G)=\alpha(G)\quad\text{for some }r\in\mathbb{N}.

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 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.