On maximal antichains containing no set and its complement
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3465294 (Why is no real title available?)
- scientific article; zbMATH DE number 3573875 (Why is no real title available?)
- scientific article; zbMATH DE number 3636041 (Why is no real title available?)
- scientific article; zbMATH DE number 3065933 (Why is no real title available?)
- A Combinatorial Theorem on Systems of Sets
- A generalization of a combinatorial theorem of macaulay
- A minimization problem concerning subsets of a finite set
- A short proof of Sperner's lemma
- An existence theorem for antichains
- Extensions of the Erdös-Ko-Rado Theorem
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- Intersection theorems for systems of finite sets
- Logarithmic order of free distributive lattice
- More on the generalized Macaulay theorem. II
- On Existence of Distinct Representative Sets for Subsets of a Finite Set
- On the Divisors of a Number
- Sperner systems consisting of pairs of complementary subsets
Cited in
(10)- Tight bounds for Katona's shadow intersection theorem
- On multiset k-families
- Several families with incomparability and complementarity conditions
- On maximal families of subsets of a finite set
- On maximal antichains consisting of sets and their complements
- Antichains in the set of subsets of a multiset
- The cubical poset is additive
- Sperner families satisfying additional conditions and their convex hulls
- An Erdős-Ko-Rado theorem for multisets
- An extremal problem for antichains of subsets of a multiset
This page was built for publication: On maximal antichains containing no set and its complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154463)
