𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A randomized version of Ramsey's theorem

✍ Scribed by Luca Gugelmann; Yury Person; Angelika Steger; Henning Thomas


Book ID
112187427
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
185 KB
Volume
41
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Randomized Version of RamseyΚΌs Theorem
✍ Luca Gugelmann; Yury Person; Angelika Steger; Henning Thomas πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 188 KB
Weak versions of Ramsey's theorem
✍ Richard Rado πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 359 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