Matching conjecture for the Stanley inequality graph
Statement
Let be the bipartite graph defined above, with the parts and edges constructed from the relevant sets of linear extensions. Matching conjecture. There exists a maximal matching in that covers every vertex in . This conjecture proposes a matching-based route to a direct injection proving Stanley's inequality. The source notes that every vertex of has at least one incident edge, but does not establish the existence of a matching covering all of .
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.