Abstract
Let S denote a set of N objects. By a Sperner collection on S we mean a collection of subsets of S such that no one contain another. In [1], Sperner showed that no such collection could have more than N C [N/2] members.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
E. Sperner, Ein Satz über Untermenger einer endlichen Menge, Math.Z. 27 (1928), 544–548.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lubell, D. (2009). A Short Proof of Sperner’s Lemma. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_28
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4842-8_28
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4841-1
Online ISBN: 978-0-8176-4842-8
eBook Packages: Springer Book Archive