𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a ramsey-theoretic property of orders

✍ Scribed by Vince Grolmusz

Book ID
103507895
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
360 KB
Volume
61
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Ramsey Property of Order Types
A Ramsey Property of Order Types
✍ Jaroslav NeΕ‘etΕ™il; Pavel Valtr πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 425 KB

Two configurations (i.e., finite planar point sets) are said to be of the same order type, if there is a bijection between them which preserves orientations of triples of points. We show a Ramsey-type result about order types which yields that any configuration of a proper order type (in general pos

A Ramsey theoretic problem for finite or
A Ramsey theoretic problem for finite ordered sets
✍ H.A. Kierstead; W.T. Trotter πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 467 KB

In this paper, we consider the following Ramsey theoretic problem for finite ordered sets: For each II 3 1, what is the least integer f(n) so that for every ordered set P of width it, there exists an ordered set Q of width f(n) such that every 2-coloring of the points of Q produces a monochromatic

Generalizations of a Ramsey-theoretic re
Generalizations of a Ramsey-theoretic result of chvΓ‘tal
✍ Stefan A. Burr; Paul ErdΓΆs πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

## Abstract ChvΓ‘tal has shown that if __T__ is a tree on __n__ points then __r__(__K~k~, T__) = (__k__ – 1) (__n__ – 1) + 1, where __r__ is the (generalized) Ramsey number. It is shown that the same result holds when __T__ is replaced by many other graphs. Such a __T__ is called __k__‐good. The res

A GAME-THEORETIC PROOF OF ANALYTIC RAMSE
A GAME-THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM
✍ 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