✦ LIBER ✦

The polarized Ramsey’s theorem

✍ Scribed by Damir D. Dzhafarov; Jeffry L. Hirst

Book ID: 105842320
Publisher: Springer
Year: 2008
Tongue: English
Weight: 297 KB
Volume: 48
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-008-0108-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey’s theorem for trees: the polarize

Ramsey’s theorem for trees: the polarized tree theorem and notions of stability

✍ Damir D. Dzhafarov; Jeffry L. Hirst; Tamara J. Lakins 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 251 KB

Ramsey's Representation Theorem

✍ Richard Bradley 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 54 KB

Ramsey’s theorem and König’s Lemma

✍ T. E. Forster; J. K. Truss 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 117 KB

Two remarks on Ramsey's theorem

✍ Jaroslav Nes̆etr̆il; Vojtĕch Rödl 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 131 KB

We present a very simple proof of the fact (due to P. Erd~s and R. Rado) that Ram~ey's theorem doesn't hold for partitions of infinite subsets. We also present a proof of an induced Ramsey theorem for partitions of complete subgraphs (due to W. Deuber and authors) based on the theorem of R. Graham a

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

Weak versions of Ramsey's theorem

✍ Richard Rado 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 359 KB