Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions (Q1151395): Difference between revisions

@@ Property / cites work @@
+A finite set covering theorem II
@@ Property / cites work: A finite set covering theorem II / rank @@
+Normal rank
@@ Property / cites work @@
+A minimization problem concerning subsets of a finite set
+Normal rank
@@ Property / cites work @@
+Existence theorems for Sperner families
@@ Property / cites work: Existence theorems for Sperner families / rank @@
+Normal rank
@@ Property / cites work @@
+On Sperner families satisfying an additional condition
+Normal rank
@@ Property / cites work @@
+Extensions of the Erdös-Ko-Rado Theorem
@@ Property / cites work: Extensions of the Erdös-Ko-Rado Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On Sperner families in which no k sets have an empty intersection
+Normal rank
@@ Property / cites work @@
+On Sperner families in which no k sets have an empty intersection. II
+Normal rank
@@ Property / cites work @@
+On Sperner families in which no k sets have an empty intersection. III
+Normal rank
@@ Property / cites work @@
+Some results on Sperner families
@@ Property / cites work: Some results on Sperner families / rank @@
+Normal rank
@@ Property / cites work @@
+Two applications (for search theory and truth functions) of Sperner type theorems
+Normal rank
@@ Property / cites work @@
+A short proof of Sperner's lemma
@@ Property / cites work: A short proof of Sperner's lemma / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Theorem on Systems of Sets
@@ Property / cites work: A Combinatorial Theorem on Systems of Sets / rank @@
+Normal rank