A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem

DOI10.1016/0097-3165(71)90035-5zbMath0225.05003OpenAlexW2061989984MaRDI QIDQ2548598

J. Schönheim

Publication date: 1971

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(71)90035-5

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)

Related Items (14)

Semiantichains and Unichain Coverings in Direct Products of Partial Orders ⋮ How robust is the n-cube? ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ On the order supergraph of the power graph of a finite group ⋮ On the independence number of the power graph of a finite group ⋮ AZ-identities and strict 2-part Sperner properties of product posets ⋮ Vertex Turán problems in the hypercube ⋮ Sperner's theorem on maximal-sized antichains and its generalization ⋮ Extremal theorems on divisors of a number ⋮ Skew chain orders and sets of rectangles ⋮ An extremal problem on the set of noncoprime divisors of a number ⋮ Ramsey-Sperner theory ⋮ On certain sets of divisors of a number ⋮ A generalization of some generalizations of Sperner's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• On a lemma of Littlewood and Offord on the distribution of certain sums
• A Combinatorial Theorem on Systems of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a lemma of Littlewood and Offord

This page was built for publication: A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem