Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
From MaRDI portal
Publication:5736604
DOI10.1137/1108023zbMath0123.36303OpenAlexW2052840523WikidataQ55954286 ScholiaQ55954286MaRDI QIDQ5736604
Publication date: 1963
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1108023
Related Items (61)
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Multicoloured extremal problems ⋮ All maximum 2-part Sperner families ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ On the average rank of LYM-sets ⋮ Extremal problems for finite sets and convex hulls---a survey ⋮ Families of chains of a poset and Sperner properties ⋮ Domination analysis for minimum multiprocessor scheduling ⋮ AZ-style identities of downsets and upsets ⋮ The number of unrelated partitions ⋮ Minimum weight flat antichains of subsets ⋮ Pseudo-LYM inequalities and AZ identities ⋮ Sperner type theorems with excluded subposets ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ A Meshalkin theorem for projective geometries ⋮ A LYM inequality for induced posets ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ Generic type of Ahlswede–Zhang style identities ⋮ Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) ⋮ Generalizing Sperner's lemma to a free module over a special principal ideal ring ⋮ On maximal families of subsets of a finite set ⋮ Formalising the Kruskal-Katona theorem in Lean ⋮ Localized versions of extremal problems ⋮ On maximal antichains consisting of sets and their complements ⋮ Sperner's Problem forG-Independent Families ⋮ On maximal antichains containing no set and its complement ⋮ An upper bound on the size of diamond-free families of sets ⋮ Saturated Graphs of Prescribed Minimum Degree ⋮ An identity in combinatorial extremal theory ⋮ Strong qualitative independence. ⋮ On Sperner families in which no k sets have an empty intersection. III ⋮ On almost \(k\)-covers of hypercubes ⋮ A probabilistic proof for the Lym-inequality ⋮ Minimum number of affine simplices of given dimension ⋮ The local Kostant-PBW ordering ⋮ AZ-identities and strict 2-part Sperner properties of product posets ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ Largest families without an \(r\)-fork ⋮ An adaptive algorithm for group testing for complexes ⋮ Extensions of the Erdös-Ko-Rado Theorem ⋮ Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals ⋮ Helly property in finite set systems ⋮ Weighted cross-intersecting families ⋮ Extremal set theory for the binomial norm ⋮ Unnamed Item ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ Some new results on the Littlewood-Offord problem ⋮ Yanamoto inequality and gatherings ⋮ Old and new applications of Katona's circle ⋮ Uniqueness in Harper's vertex-isoperimetric theorem ⋮ \(l\)-trace \(k\)-Sperner families of sets ⋮ Restricted Sperner families and s-systems ⋮ Colouring set families without monochromatic \(k\)-chains ⋮ Investigating posets via their maximal chains ⋮ Largest family without \(A \cup B \subseteq C \cap D\) ⋮ Some remarks on normalized matching ⋮ Extremal problems among subsets of a set ⋮ Intersecting Sperner families and their convex hulls ⋮ A generalization of the AZ identity ⋮ A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains ⋮ Abelian groups yield many large families for the diamond problem
This page was built for publication: Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
