Linear extensions of finite posets
Swee Hong Chan, Igor Pak
TL;DR
This paper surveys inequalities related to counting linear extensions of finite posets, highlighting bounds, equality conditions, open problems, and computational complexity aspects.
Contribution
It provides a comprehensive overview of inequalities for linear extensions, including recent results, open problems, and complexity considerations.
Findings
Reviewed many examples of inequalities
Discussed conditions for equality in bounds
Presented recent results and open problems
Abstract
We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the inequalities, and the computational complexity aspects of the results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · graph theory and CDMA systems · Limits and Structures in Graph Theory