F. Shi et Wx. Li, THE DENSITY OF A MAXIMUM MINIMAL CUT IN THE SUBSET LATTICE OF A FINITE-SET IS ALMOST ONE, Discrete mathematics, 123(1-3), 1993, pp. 111-115
Let G(n) be the Hasse diagram of the subset lattice of a set with n el
ements. It is shown that, for any delta > 0, there is a minimal cut of
G(n) which has more than (1 - delta)2'' elements whenever n is large
enough, and that the density of a maximum minimal cut of G(n) is 1/2 w
hen n less than or equal to 5, where 5 is best possible.