Polynomial-time computation of poset dimension from a linear extension graph
Statement
Let be a poset and let be its linear extension graph, whose vertices are the linear extensions of . The dimension is the minimum size of a realizer of , that is, a set of linear extensions whose intersection is .
Polynomial-time dimension conjecture. The dimension of a poset given its linear extension graph can be determined in polynomial time.
The proposition preceding this conjecture gives a quasi-polynomial-time algorithm, while the conjecture asks whether this can be improved to polynomial time. This would match the expected complexity suggested by the exponential size of a linear extension graph relative to the underlying poset.
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.