ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF 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 FF is the distance matrix of a connected graph.

Generalised squashed cube conjecture. Then FF 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 δ(F)≥1 \delta(F)\geq 1 for non-empty FF; 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 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.