Christofides–Markström conjecture on the fractional clique-cover bound
Statement
Let be an undirected graph. Write for its guessing number, let be its vertex set, and let denote the fractional clique-cover number of . Christofides–Markström conjecture. If is an undirected graph then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.