A Ramsey-Sperner theorem

DOI10.1007/BF02582928zbMath0584.05002OpenAlexW2034771570MaRDI QIDQ1070227

Zoltan Fueredi

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02582928

zbMATH Keywords

subsetsset coloring

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05)

Related Items

k-color Sperner theorems ⋮ Convex hulls of more-part Sperner families ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ Ramsey-Sperner theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stronger form of an M-part Sperner theorem
• k-color Sperner theorems
• Convex hulls of more-part Sperner families
• 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