A GAME-THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM
β Scribed by Kazuyuki Tanaka
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 217 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We give a simple gameβtheoretic proof of Silver's theorem that every analytic set is Ramsey. A set P of subsets of Ο is called Ramsey if there exists an infinite set H such that either all infinite subsets of H are in P or all out of P. Our proof clarifies a strong connection between the Ramsey property of partitions and the determinacy of infinite games.
π SIMILAR VOLUMES
Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo
## Abstract Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function __r__~__f__~ (__a__~1~, __a__~2~, β¦, __a__~__k__~) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case __k__=2. In this
This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.