Geometrical techniques for estimating numbers of linear extensions
From MaRDI portal
Publication:1304428
DOI10.1006/eujc.1999.0299zbMath0941.06006MaRDI 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 bound; comparability graph; lower bound; partial order; polyhedral combinatorics; complement; number of linear extensions; two-dimensional order
06A07: Combinatorics of partially ordered sets
Related Items
Why Is Pi Less Than Twice Phi?, The hull metric on Coxeter groups, Geometric inequalities for anti-blocking bodies, Effective Poset Inequalities, Characterizing isometries on the order polytope with an application to the theory of fuzzy measures, 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