𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Ramsey-type positional games

✍ Scribed by Jaroslav Nešetřil; Tomáš Valla

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
132 KB
Volume
64
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Beck introduced the concept of Ramsey games by studying the game versions of Ramsey and van der Waerden theorems. We contribute to this topic by investigating games corresponding to structural extensions of Ramsey and van der Waerden theorems—the theorem of Brauer, structural and restricted Ramsey theorems. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 330–342, 2010

📜 SIMILAR VOLUMES

On a Ramsey-type problem
On a Ramsey-type problem
✍ F. R. K. Chung 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB
A generalization of a Ramsey-type theore
A generalization of a Ramsey-type theorem on hypermatchings
✍ Paul Baginski 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## 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

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

Ramsey-type results for oriented trees
Ramsey-type results for oriented trees
✍ Kohayakawa, Yoshiharu; ?uczak, Tomasz; R�dl, Vojt?ch 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 486 KB

For a graph G and a digraph h, w e write Gfi (respectively, G 5 2) if every orientation (respectively, acyclic orientation) of the edges of G results in an induced copy of k In this note w e study how small the graphs G such that Gor such that G 5 i/ may be, if k is a given oriented tree ? on n vert

A ramsey-type bound for rectangles
A ramsey-type bound for rectangles
✍ T�th, G�za 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

It is proved that for any rectangle T and for any 2-coloring of the points of the 5dimensional Euclidean space, one can always find a rectangle T' congruent to T , all of whose vertices are of the same color. We also show that for any k-coloring of the k2 + o(k2)-dimensional space, there is a monoch