Sperner systems consisting of pairs of complementary subsets
From MaRDI portal
Publication:1843568
DOI10.1016/0097-3165(73)90086-1zbMath0281.05001OpenAlexW2021557596MaRDI QIDQ1843568
Publication date: 1973
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(73)90086-1
Related Items
Intersecting \(P\)-free families ⋮ The maximum number of balancing sets ⋮ Extremal problems for finite sets and convex hulls---a survey ⋮ A Group-Theoretic Setting for Some Intersecting Sperner Families ⋮ Some results on Sperner families ⋮ On maximal families of subsets of a finite set ⋮ On maximal antichains consisting of sets and their complements ⋮ On maximal antichains containing no set and its complement ⋮ On a clique covering problem of Orlin ⋮ Strong qualitative independence. ⋮ Sperner families satisfying additional conditions and their convex hulls ⋮ Rényi 100, quantitative and qualitative (in)dependence ⋮ Extensions of the Erdös-Ko-Rado Theorem ⋮ Intersecting antichains and shadows in linear lattices ⋮ An Erdős-Ko-Rado theorem for restricted signed sets ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Several families with incomparability and complementarity conditions ⋮ Extremal theorems on divisors of a number ⋮ The covering radius of extreme binary 2-surjective codes ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) ⋮ An extremal problem among subsets of a set ⋮ \(m\)-qualitatively independent families ⋮ Generalized forbidden subposet problems ⋮ Some Results on Systems of Finite Sets That Satisfy a Certain Intersection Condition ⋮ An extremal theorem on divisors of a number ⋮ Intersecting Sperner families and their convex hulls
Cites Work
