Abstract
Let B(j, k; n) be the ordered set obtained by ordering the j element and k element subsets of an n element set by inclusion. We review results and proof techniques concerning the dimension dim(j, k; n) of B(j, k; n) for various ranges of the arguments j, k, and n.
Original language | English (US) |
---|---|
Pages (from-to) | 141-155 |
Number of pages | 15 |
Journal | Discrete Mathematics |
Volume | 201 |
Issue number | 1-3 |
DOIs | |
State | Published - Apr 28 1999 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics