The Number of Linear Extensions of the Boolean Lattice
- 1 November 2003
- journal article
- Published by Springer Nature in Order
- Vol. 20 (4) , 333-345
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The number of k-SAT functionsRandom Structures & Algorithms, 2003
- Entropy, independent sets and antichains: A new approach to Dedekind’s problemProceedings of the American Mathematical Society, 2001
- An Entropy Approach to the Hard-Core Model on Bipartite GraphsCombinatorics, Probability and Computing, 2001
- Entropy and SortingJournal of Computer and System Sciences, 1995
- Linear extensions of semiorders: a maximization problemDiscrete Mathematics, 1992
- The number of linear extensions of subset orderingDiscrete Mathematics, 1987
- Some intersection theorems for ordered sets and graphsJournal of Combinatorial Theory, Series A, 1986
- The FKG Inequality and Some Monotonicity Properties of Partial OrdersSIAM Journal on Algebraic Discrete Methods, 1980