Weakening conjecture for compatible-inclusion problems
Statement
Let be an odd integer, and let be a compatible-inclusion problem, with its -weakening defined by retaining directed edges represented by paths of length at most . The compatible-inclusion weakening conjecture. There is an odd integer such that, for any compatible-inclusion problem , if has a solution, then the -weakening of has a simple solution.
This is a combinatorial reformulation related to the upset matching conjecture. The paper notes that the case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.