ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an undirected graph. Write gn⁡(G)\operatorname{gn}(G) for its guessing number, let V(G)V(G) be its vertex set, and let κf(G)\kappa_f(G) denote the fractional clique-cover number of GG. Christofides–Markström conjecture. If GG is an undirected graph then

gn⁡(G)=∣V(G)∣−κf(G).\operatorname{gn}(G)=|V(G)|-\kappa_f(G).

This conjecture asserts that the fractional clique-cover lower bound is always sharp. It is known for several families, including perfect graphs, odd cycles, and complements of odd cycles, but the general case remains 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.