On maximal antichains consisting of sets and their complements
From MaRDI portal
Publication:1150366
DOI10.1016/0097-3165(80)90034-5zbMath0456.05004MaRDI QIDQ1150366
Publication date: 1980
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(80)90034-5
05A05: Permutations, words, matrices
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On maximal antichains containing no set and its complement
- Sperner systems consisting of pairs of complementary subsets
- Existence theorems for Sperner families
- Erdős-Ko-Rado from Kruskal-Katona
- A minimization problem concerning subsets of a finite set
- Logarithmic order of free distributive lattice
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extensions of the Erdös-Ko-Rado Theorem
- A short proof of Sperner's lemma
- A generalization of a combinatorial theorem of macaulay
- On Existence of Distinct Representative Sets for Subsets of a Finite Set
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set