Some results on Sperner families

DOI10.1016/0097-3165(79)90073-6zbMath0421.05001OpenAlexW2017307105MaRDI QIDQ1132876

S. H. Smith

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90073-6

zbMATH Keywords

subsetsSperner family

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

On Sperner families in which no k sets have an empty intersection ⋮ On maximal families of subsets of a finite set ⋮ Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions ⋮ On Sperner families in which no k sets have an empty intersection. II ⋮ Sperner families satisfying additional conditions and their convex hulls ⋮ On Sperner families in which no k sets have an empty intersection. III ⋮ Sharpening the LYM inequality ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Polytopes determined by complementfree Sperner families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Sperner families satisfying an additional condition
• A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities
• Extremal problems for finite sets and convex hulls---a survey
• Sperner systems consisting of pairs of complementary subsets
• Existence theorems for Sperner families
• A simple proof of the Kruskal-Katona theorem
• A minimization problem concerning subsets of a finite set
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A short proof of Sperner's lemma
• A generalization of a combinatorial theorem of macaulay