On counting Sperner families

DOI10.1016/0097-3165(79)90002-5zbMath0431.05006OpenAlexW2024348499MaRDI QIDQ1137998

Raymond Balbes

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)90002-5

zbMATH Keywords

recursive formulaSperner familyfree distributive latticenumber of Sperner families having given intersection numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Free lattices, projective lattices, word problems (06B25)

Related Items (1)

The linear chromatic number of a Sperner family

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems among subsets of a set
• Existence theorems for Sperner families
• On the average size of the sets in a Sperner family
• Logarithmic order of free distributive lattice
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A short proof of Sperner's lemma
• Products of Zero-One Matrices
• A generalization of Sperner's lemma
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Recursive formulas on free distributive lattices

This page was built for publication: On counting Sperner families