On maximal antichains containing no set and its complement

DOI10.1016/0012-365X(81)90267-3zbMath0465.05001OpenAlexW2039556593MaRDI QIDQ1154463

Hans-Dietrich O. F. Gronau, G. F. Clements

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90267-3

zbMATH Keywords

antichaindivisors of squarefree numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items

An extremal problem for antichains of subsets of a multiset, The cubical poset is additive, On multiset k-families, On maximal families of subsets of a finite set, On maximal antichains consisting of sets and their complements, Sperner families satisfying additional conditions and their convex hulls, An Erdős-Ko-Rado theorem for multisets, Several families with incomparability and complementarity conditions, Tight bounds for Katona's shadow intersection theorem, Antichains in the set of subsets of a multiset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An existence theorem for antichains
• More on the generalized Macaulay theorem. II
• Sperner systems consisting of pairs of complementary subsets
• A minimization problem concerning subsets of a finite set
• Logarithmic order of free distributive lattice
• Extensions of the Erdös-Ko-Rado Theorem
• Intersection theorems for systems of finite sets
• A short proof of Sperner's lemma
• On the Divisors of a Number
• A Combinatorial Theorem on Systems of Sets
• 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