Let P be a poset, consisting of all sets X [n]=[1, 2, ..., n] which contain at least one of a given collection F of 2-subsets of [n], ordered by inclusion. By modifying a construction of Greene and Kleitman, we show that if F is hamiltonian, that is, contains [1, 2], [2, 3], ..., [n&1, n] and [1, n]
Chain Partitions of Products of Two Chains
β Scribed by Zbigniew Lonc; Muktar E. Elzobi
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 167 KB
- Volume
- 86
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let 2 [n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, ..., n} ordered by inclusion. Recall that 2 [n] may be partitioned into what we call the canonical symmetric chain decomposition (due to de Bruijn, Tengbergen, and Kruyswijk), or CSCD. Motivated by a question of FΓΌ
After a fierce battle, Erin of Elliath and her comrades have brought hope back to the Servants of the Bright Heart. The throne of Marantine has been reclaimed, and a new king rules the last remnants of Lernan's people. Within the lands of the Dark Empire, however, the power of the Bright Heart grow