𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Games of Chains and Cutsets in the Boolean Lattice II

✍ Scribed by David Linnan Li; Shahriar Shahriari

Book ID
110310296
Publisher
Springer Netherlands
Year
2001
Tongue
English
Weight
166 KB
Volume
18
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the f-vectors of Cutsets in the Boole
On the f-vectors of Cutsets in the Boolean Lattice
✍ Matthew Haines; Shahriar Shahriari πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 102 KB

A cutset in the poset 2 [n] , of subsets of [1, ..., n] ordered by inclusion, is a subset of 2 [n] that intersects every maximal chain. Let 0 : 1 be a real number. Is it possible to find a cutset in 2 [n] that, for each 0 i n, contains at most : ( n i ) subsets of size i ? Let :(n) be the greatest l