𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shellings and the Lower Bound Theorem

✍ Scribed by G. Blind; R. Blind


Publisher
Springer
Year
1999
Tongue
English
Weight
120 KB
Volume
21
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A lower bound for Ramsey's theorem
✍ Joram Hirschfeld πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 291 KB

For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i