✦ 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
DOI: 10.1016/0097-3165(76)90079-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A constructive version of Sperner's lemm

A constructive version of Sperner's lemma and Brouwer's fixed point theorem

✍ A. K. Khalifa 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 1 views

On Strong Versions of the Central Limit

On Strong Versions of the Central Limit Theorem

✍ Peter Schatte 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB 👁 1 views

Hypergraphs and Sperner's theorem

✍ B. Monjardet 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A continuous analogue of Sperner's theor

A continuous analogue of Sperner's theorem

✍ 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

Generalized versions of Hall's theorem

✍ D.J.A. Welsh 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Weak versions of Ramsey's theorem

✍ Richard Rado 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 359 KB