Kravitz–Sah conjecture on the minimum size of posets with n linear extensions
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.
References
- Swee Hong Chan and Igor Pak, “Linear extensions and continued fractions”, arXiv:2401.09723 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.