On the average size of the sets in a Sperner family

DOI10.1016/0012-365X(73)90043-5MaRDI QIDQ2562857zbMATH OpenFDO

Authors Daniel J. Kleitman, Eric C. Milner

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(73)90043-5

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites work

• A short proof of Sperner's lemma

Cited in

(10)

• On multiset k-families
• On counting Sperner families
• An existence theorem for antichains
• Extremal problems for finite sets and convex hulls---a survey
• Existence theorems for Sperner families
• On the average rank of LYM-sets
• Maximum union-free subfamilies
• A Note on Uniquely lntersectable Graphs
• Minimal completely separating systems of \(k\)-sets
• A vector monotonicity assumption for multiple instruments

This page was built for publication: On the average size of the sets in a Sperner family

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562857)