✦ LIBER ✦

Ramsey's Theorem for a Class of Categories

✍ Scribed by R. L. Graham, K. Leeb and B. L. Rothschild

Book ID: 123650494
Publisher: National Academy of Sciences
Year: 1972
Tongue: English
Weight: 299 KB
Volume: 69
Category: Article
ISSN: 0027-8424
DOI: 10.2307/60994

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey's theorem for a class of categori

Ramsey's theorem for a class of categories

✍ R.L Graham; K Leeb; B.L Rothschild 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 801 KB

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

A generalization of Ramsey's theorem for

A generalization of Ramsey's theorem for regular trees

✍ Walter Deuber 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 331 KB

A randomized version of Ramsey's theorem

✍ Luca Gugelmann; Yury Person; Angelika Steger; Henning Thomas 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

The Independence of Ramsey's Theorem

✍ E. M. Kleinberg 📂 Article 📅 1969 🏛 Association for Symbolic Logic 🌐 English ⚖ 242 KB

A conjecture concerning Ramsey's theorem

✍ Martin Erickson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 204 KB

## 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