𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cutsets of Boolean lattices

✍ Scribed by Richard Nowakowski

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
575 KB
Volume
63
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let a be an element of a finite ordered set P. A subset F of P is a cutset for a if every element of F is incomparable to a and if every maximal chain of P intersects F U {a}. The cardinalities of minimum sized cutsets for elements of finite boolean lattices are determined

πŸ“œ 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