Kravitz–Sah conjecture on the minimum size of posets with n linear extensions
Statement
Let denote the minimum number of elements in a finite poset with exactly linear extensions. Kravitz–Sah conjecture.
This would improve the known bound and would give substantially smaller posets realizing prescribed numbers of linear extensions.
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.