๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Strong versions of Sperner's theorem

โœ Scribed by Curtis Greene; Daniel J Kleitman


Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
515 KB
Volume
20
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Hypergraphs and Sperner's theorem
โœ B. Monjardet ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 237 KB
A continuous analogue of Sperner's theor
โœ Daniel A. Klain; Gian-Carlo Rota ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB ๐Ÿ‘ 2 views

One of the best-known results of extremal combinatorics is Sperner's theorem, which asserts that the maximum size of an antichain of subsets of an n-element set equals the binomial coefficient n n/2 , that is, the maximum of the binomial coefficients. In the last twenty years, Sperner's theorem has

Weak versions of Ramsey's theorem
โœ Richard Rado ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 359 KB