Geometrical techniques for estimating numbers of linear extensions
From MaRDI portal
Publication:1304428
DOI10.1006/eujc.1999.0299zbMath0941.06006OpenAlexW2057635467MaRDI QIDQ1304428
Béla Bollobás, Alexander Sidorenko, Graham R. 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
upper boundcomparability graphlower boundpartial orderpolyhedral combinatoricscomplementnumber of linear extensionstwo-dimensional order
Related Items (9)
Geometric inequalities for anti-blocking bodies ⋮ The hull metric on Coxeter groups ⋮ Characterizing isometries on the order polytope with an application to the theory of fuzzy measures ⋮ Effective Poset Inequalities ⋮ Separable elements: linear extensions, graph associahedra, and splittings of Weyl groups ⋮ Separable elements and splittings of Weyl groups ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ Why Is Pi Less Than Twice Phi? ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset
This page was built for publication: Geometrical techniques for estimating numbers of linear extensions
