## 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 linear Ramsey theorem
β Scribed by David Feldman; James Propp
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 350 KB
- Volume
- 95
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract For an __r__βuniform hypergraph __G__ define __N__(__G__, __l__; 2) (__N__(__G__, __l__; β€~__n__~)) as the smallest integer for which there exists an __r__βuniform hypergraph __H__ on __N__(__G__, __l__; 2) (__N__(__G__,__l__; β€~__n__~)) vertices with clique(__H__)β<β__l__ such that eve
## Abstract We show that if __G__ is a Ramsey sizeβlinear graph and __x,y__ β __V__ (__G__) then if we add a sufficiently long path between __x__ and __y__ we obtain a new Ramsey sizeβlinear graph. As a consequence we show that if __G__ is any graph such that every cycle in __G__ contains at least
## Abstract Let us call a finite subset __X__ of a Euclidean __m__βspace E^m^ __Ramsey__ if for any positive integer __r__ there is an integer __n__ = __n__(__X;r__) such that in any partition of E^n^ into __r__ classes __C__~1~,β¦, __C~r~__, some __C~i~__ contains a set __X__' which is the image of