On the f-vectors of Cutsets in the Boole
β
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