Twin-free reduction conjecture for (3+1)-free posets
Statement
Let be a -free poset, meaning that it contains no induced subposet isomorphic to the disjoint union of a -chain and a -chain. Call twin-free when there is no graph with a vertex such that , where is obtained by twinning at .
Twin-free reduction conjecture. If is -free and twin-free, then is -positive.
The source says that, if the preceding -free twinning conjecture is solved, the Stanley–Stembridge conjecture can be reduced to this conjecture. Its independent resolution status is not given.
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.