The Sperner property for posets: A probabilistic approach

DOI10.1016/0012-365X(85)90129-3zbMath0564.05003MaRDI QIDQ1057860

Jean-Pierre Dion

Publication date: 1985

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

zbMATH Keywords

Galton-Watson processSperner propertystochastic branching processes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Other combinatorial set theory (03E05)

Cites Work

• On chains and Sperner k-families in ranked posets
• Sperner properties for groups and relations
• Maximal sized antichains in partial orders
• A decomposition theorem for partially ordered sets
• Recurrence formula and the maximum likelihood estimation of the age in a simple branching process
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• A short proof of Sperner's lemma
• A generalization of Sperner's lemma
• On a lemma of Littlewood and Offord
• The structure of Sperner k-families

This page was built for publication: The Sperner property for posets: A probabilistic approach