k-color Sperner theorems

DOI10.1016/0097-3165(86)90005-1zbMath0601.05003OpenAlexW2080447966MaRDI QIDQ1080849

Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer

Publication date: 1986

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(86)90005-1

zbMATH Keywords

set coloring

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items (5)

All maximum 2-part Sperner families ⋮ Convex hulls of more-part Sperner families ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ Ramsey-Sperner theory ⋮ A Ramsey-Sperner theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stronger form of an M-part Sperner theorem
• A Ramsey-Sperner theorem
• The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem
• A three part Sperner theorem
• On a lemma of Littlewood and Offord on the distribution of certain sums
• Another Three Part Sperner Theorem
• A short proof of Sperner's lemma

This page was built for publication: k-color Sperner theorems