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

Two embedding theorems for lower bounded lattices

โœ Scribed by K. V. Adaricheva

Publisher
Springer
Year
1996
Tongue
English
Weight
280 KB
Volume
36
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower bound for Ramsey's theorem
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