Generalised squashed cube conjecture for exact clause-sets
Statement
Let be an exact clause-set, meaning that its deficiency is maximal among all clause-sets with the same conflict matrix or conflict multigraph. Suppose that the conflict matrix of is the distance matrix of a connected graph.
Generalised squashed cube conjecture. Then is matching lean.
This generalises the squashed cube conjecture, which was solved by Peter Winkler. Under the same assumptions, Winkler's original result is equivalent to for non-empty ; the stronger matching-lean assertion is not resolved 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.