𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hypergraphs and Sperner's theorem

✍ Scribed by B. Monjardet

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
237 KB
Volume
5
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strong versions of Sperner's theorem
Strong versions of Sperner's theorem
✍ Curtis Greene; Daniel J Kleitman πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 515 KB
Hall's theorem for hypergraphs
Hall's theorem for hypergraphs
✍ Ron Aharoni; Penny Haxell πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 89 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

Chromatic Index of Hypergraphs and Shann
Chromatic Index of Hypergraphs and Shannon’s Theorem
✍ TomΓ‘Ε‘ DvoΕ™Γ‘k πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 85 KB

A classical theorem of Claude Shannon states that for any multigraph G without loops, Ο‡ (G) ≀ 3 2 (G) . We suggest a generalization of Shannon's theorem to hypergraphs and prove it in case of hypergraphs without repeated edges of size 2.