Inequalities for the number of linear extensions

DOI10.1007/BF00571183zbMath0760.06003MaRDI QIDQ1198479

Alexander Sidorenko

Publication date: 16 January 1993

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

networkflowincomparability graphnumber of linear extensions

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Deterministic network models in operations research (90B10)

Related Items (9)

Extensions of the Kahn-Saks inequality for posets of width two ⋮ The hull metric on Coxeter groups ⋮ Badness of Serial Fit Revisited ⋮ Approximating the number of linear extensions ⋮ Effective Poset Inequalities ⋮ Separable elements: linear extensions, graph associahedra, and splittings of Weyl groups ⋮ Separable elements and splittings of Weyl groups ⋮ Why Is Pi Less Than Twice Phi? ⋮ The bounds for the number of linear extensions via chain and antichain coverings

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
• Partially Ordered Sets
• Unnamed Item

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