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
Ramsey's theorem for a class of categories
β Scribed by R.L Graham; K Leeb; B.L Rothschild
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 801 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## P(c, m). If the edges of a countable injinite complete graph G are exactly c-colored, then there exists a countable infinite complete subgraph H of G whose edges are exactly m-colored. The purpose of this note is to inquire as to which pairs c, m of positive integers make P(c, m) a true stateme
We prove some generalizations of Baire's category theorem for chains of iterates of multifunctions defined on Δech-complete spaces. In particular, we extend Lennard's results stated for functions on complete metric spaces. a 1995 Academic Press. Inc.