Geometrical techniques for estimating numbers of linear extensions

DOI10.1006/EUJC.1999.0299MaRDI QIDQ1304428zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Alexander Sidorenko, Graham Brightwell

Publication date 7 May 2000

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1999.0299

zbMATH Keywords

comparability graphcomplementlower boundnumber of linear extensionspartial orderpolyhedral combinatoricstwo-dimensional orderupper bound

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Recommendations

• Inequalities for the number of linear extensions
• Linear extensions and comparable pairs in partial orders
• The average number of linear extensions of a partial order

Cited in

(12)

• Inequalities for the number of linear extensions
• Linear extensions and comparable pairs in partial orders
• Separable elements and splittings of Weyl groups
• Separable elements: linear extensions, graph associahedra, and splittings of Weyl groups
• Adjacency on the order polytope with applications to the theory of fuzzy measures
• Bottom-up: a new algorithm to generate random linear extensions of a poset
• Why is pi less than twice phi?
• The hull metric on Coxeter groups
• Geometric inequalities for anti-blocking bodies
• Effective Poset Inequalities
• Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
• Characterizing isometries on the order polytope with an application to the theory of fuzzy measures

This page was built for publication: Geometrical techniques for estimating numbers of linear extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304428)