Anderson and Griggs proved independently that a rank-symmetric-unimodal normalized
matching (NM) poset possesses a nested chain decomposition (or nesting), and Griggs later …

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 …

Let 2 [n] denote the poset of all subsets of [n]={1, 2,..., n} ordered by inclusion. Following
Gutterman and Shahriari (Order 14, 1998, 321–325) we consider a game G n (a, b, c). This …

In this paper we will survey a collection of recent results about chains and cutsets in the
Boolean lattice and some other posets. In particular, we consider the possibilities for the …

Let n≥ 2 and 0≤ k≤ n− 2 be integers. We show that given any collection of k skipless
chains in 2 [n], the Boolean lattice of order n, there exists n− k edge‐disjoint maximal chains …