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