Ramsey-Sperner theory

DOI10.1016/0012-365X(87)90004-5zbMath0617.05039OpenAlexW2026551598MaRDI QIDQ1821793

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

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90004-5

zbMATH Keywords

Ramsey theoryextremal problemsSperner theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

On the structure of maximum 2-part Sperner families ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals ⋮ Minimum cutsets for an element of a Boolean lattice ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stronger form of an M-part Sperner theorem
• A Sperner-type theorem
• A Ramsey-Sperner theorem
• k-color Sperner theorems
• 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
• A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem
• A generalization of some generalizations of Sperner's theorem
• A short proof of Sperner's lemma
• On a lemma of Littlewood and Offord

This page was built for publication: Ramsey-Sperner theory