Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions
From MaRDI portal
Publication:1151395
DOI10.1007/BF01849615zbMath0458.05003MaRDI QIDQ1151395
Publication date: 1981
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Cites Work
- Some results on Sperner families
- On Sperner families in which no k sets have an empty intersection
- On Sperner families in which no k sets have an empty intersection. II
- On Sperner families in which no k sets have an empty intersection. III
- On Sperner families satisfying an additional condition
- Existence theorems for Sperner families
- A minimization problem concerning subsets of a finite set
- Two applications (for search theory and truth functions) of Sperner type theorems
- Extensions of the Erdös-Ko-Rado Theorem
- A short proof of Sperner's lemma
- A Combinatorial Theorem on Systems of Sets
- A finite set covering theorem II