Approximating the number of linear extensions

DOI10.1016/S0304-3975(96)00203-4zbMath0895.06002MaRDI QIDQ1392204

Kevin Ewacha, Nejib Zaguia, Ivan Rival

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

number of linear extensionscritical suborders

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07) Total orders (06A05)

Related Items (4)

Asymptotics of the number of standard Young tableaux of skew shape ⋮ Why Is Pi Less Than Twice Phi? ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ Obituary: Ivan Rival

Cites Work

• A recurrence for linear extensions
• Two poset polytopes
• Number of admissible linear orderings of a partially ordered set as a function of its incomparability graph
• Counting linear extensions
• Inequalities for the number of linear extensions
• Asymptotic Enumeration of Partial Orders on a Finite Set

This page was built for publication: Approximating the number of linear extensions