ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a graph, let ϑ(r)(G)\vartheta^{(r)}(G) be its order-rr copositive hierarchy bound, and let S⊥S^\perp denote the vertices adjacent to or equal to a stable set SS. For every stable set S⊆VS\subseteq V with ∣S∣=r|S|=r, the graph G∖S⊥G\setminus S^\perp is obtained by deleting S⊥S^\perp. The Gvozdenović–Laurent bound. For every r≥1r\geq1,

ϑ(r)(G)≤r+max⁡S⊆V, S stable, ∣S∣=rϑ(0)(G∖S⊥).\vartheta^{(r)}(G)\leq r+\max_{S\subseteq V,\ S\text{ stable},\ |S|=r}\vartheta^{(0)}(G\setminus S^\perp).

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