A known theorem states that there is a function f = f(k) such that every tournament T with at least f(k) vertices contains a transitive subtournament on k vertices. In this paper, the concept of an ordered r-tournament is introduced and the existence of an analogous function to f = f(k) is establish
β¦ LIBER β¦
An application of Ramsey theorem to stopping games
β Scribed by Eran Shmaya; Eilon Solan; Nicolas Vieille
- Book ID
- 117609958
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 80 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0899-8256
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An application of the Ramsey theorem to
β
A Bialostocki
π
Article
π
1986
π
Elsevier Science
π
English
β 221 KB
A set intersection theorem and an applic
β
Mark Ramras
π
Article
π
2002
π
Elsevier Science
π
English
β 48 KB
An application of ramseyβs theorem to gr
β
Oger, Francis
π
Article
π
2000
π
Taylor and Francis Group
π
English
β 242 KB
A ramsey theorem for trees, with an appl
β
Jacques Stern
π
Article
π
1978
π
The Hebrew University Magnes Press
π
English
β 361 KB
A GAME-THEORETIC PROOF OF ANALYTIC RAMSE
β
Kazuyuki Tanaka
π
Article
π
1992
π
John Wiley and Sons
π
English
β 217 KB
## 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 c
A Ramsey-type theorem and its applicatio
β
A. GyΓ‘rfΓ‘s
π
Article
π
1973
π
Springer Netherlands
π
English
β 550 KB
π 2 views