Saturating Sperner families

Details Saturating Sperner families Saturating Sperner families

2011-05-23

arxiv.org/abs/1105.4453v1

Mathematics

Combinatorics

10 pages

Scientific paper

A family $\cF \subseteq 2^{[n]}$ saturates the monotone decreasing property $\cP$ if $\cF$ satisfies $\cP$ and one cannot add any set to $\cF$ such that property $\cP$ is still satisfied by the resulting family. We address the problem of finding the minimum size of a family saturating the $k$-Sperner property and the minimum size of a family that saturates the Sperner property and that consists only of $l$-sets and $(l+1)$-sets.

Affiliated with

Also associated with

No associations

Rating

Saturating Sperner families does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Saturating Sperner families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Saturating Sperner families will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-22332