A Combinatorial Theorem on Systems of Sets
From MaRDI portal
Cited in
(36)- 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 maximal antichains containing no set and its complement
- On Sperner families in which no k sets have an empty intersection. II
- On Sperner families satisfying an additional condition
- A Sperner-type theorem for families of finite sets
- A simple proof of a theorem of Milner
- Another simple proof of a theorem of Milner
- Rectangular \(L\)-matrices
- Extremal problems for finite sets and convex hulls---a survey
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Random walks and multiply intersecting families
- Extremal problems among subsets of a set
- Weighted 3-wise 2-intersecting families
- A nonuniform Littlewood-Offord inequality for all norms
- Minimum degree and diversity in intersecting antichains
- Kruskal-Katona function and variants of cross-intersecting antichains
- A non-uniform Littlewood-Offord inequality
- Wide-sense 2-frameproof codes
- Analogues of Milner's theorem for families without long chains and of vector spaces
- Intersecting P-free families
- Multiply-intersecting families revisited
- Profile polytopes of some classes of families
- Extremal problems among subsets of a set. (Reprint)
- A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem
- Analogues of Katona's and Milner's theorems for two families
- Erdös–Ko–Rado Theorem—22 Years Later
- An extension of the Erdős–Ko–Rado Theorem
- Extensions of the Erdös-Ko-Rado Theorem
- Generalizations of theorems of Katona and Milner
- On the sizes of \(t\)-intersecting \(k\)-chain-free families
- A note on strongly and totally chain intersecting families
- On the sizes of t-intersecting k-chain-free families (extended abstract)
- Intersecting Sperner families and their convex hulls
- EKR type inequalities for 4-wise intersecting families
This page was built for publication: A Combinatorial Theorem on Systems of Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5537640)