ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c≥1c\geq 1 be an odd integer, and let (P,Q)(P,Q) be a compatible-inclusion problem, with its cc-weakening defined by retaining directed edges represented by paths of length at most cc. The compatible-inclusion weakening conjecture. There is an odd integer c≥1c\geq 1 such that, for any compatible-inclusion problem P\mathcal{P}, if P\mathcal{P} has a solution, then the cc-weakening of P\mathcal{P} has a simple solution.

This is a combinatorial reformulation related to the upset matching conjecture. The paper notes that the case c=3c=3 weakens a conjecture from the author's PhD thesis, but the supplied text gives no resolution of the present conjecture.

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.