Ramsey games
From MaRDI portal
The paper presents some results about Ramsey games. Ramsey games belong to the wider class of positional games. First, the author briefly recalls the basic concepts and results of positional games in general, and apply them to the particular case of Ramsey games. -- In the following, he makes references more detailed on the theory of positional games.
Recommendations
Cited in
(28)- Van der Waerden and Ramsey type games
- Strong Ramsey games in unbounded time
- Upper bounds on positional Paris-Harrington games
- Keeping avoider's graph almost acyclic
- Strong Ramsey games: drawing on an infinite board
- Long cycles in locally expanding graphs, with applications
- Online balanced graph avoidance games
- Weak and strong \(k\)-connectivity games
- Transitive avoidance games on boards of odd size
- Building spanning trees quickly in maker-breaker games
- On Ramsey-type positional games
- Ramsey games with giants
- The star avoidance game
- Ramsey Games
- Winning Fast in Sparse Graph Construction Games
- scientific article; zbMATH DE number 3918416 (Why is no real title available?)
- scientific article; zbMATH DE number 3922700 (Why is no real title available?)
- scientific article; zbMATH DE number 1214945 (Why is no real title available?)
- scientific article; zbMATH DE number 1943956 (Why is no real title available?)
- Frank Ramsey
- RAMSEY’S COHEIRS
- Transitive avoidance games
- scientific article; zbMATH DE number 279288 (Why is no real title available?)
- Triangular Ramsey numbers
- The Kℵ0$K^{\aleph _0}$ game: Vertex colouring
- On the clique-game
- On k-AP and k-AVOID-AP van der Waerden game
- On certain k-AP van der Waerden game
This page was built for publication: Ramsey games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598836)
