Strong Ramsey games: drawing on an infinite board

DOI10.1016/j.jcta.2017.03.008zbMath1362.05087arXiv1605.05443OpenAlexW2964106800MaRDI QIDQ2397109

Clément Requilé, Christopher Kusch, Amir Sarid, Lothar Narins, Dan Hefetz, Alexey Pokrovskiy

Publication date: 29 May 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.05443

zbMATH Keywords

Ramsey theorypositional gamesstrong games

Mathematics Subject Classification ID

Games involving graphs (91A43) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

The Kℵ0$K^{\aleph _0}$ game: Vertex colouring ⋮ Strong Ramsey games in unbounded time

Cites Work

• Unnamed Item
• Winning strong games through fast strategies for weak games
• Ramsey games
• Positional games
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• WINNING AN INFINITE COMBINATION OF GAMES
• Building Spanning Trees Quickly in Maker-Breaker Games
• Recent developments in graph Ramsey theory
• Hypergraph Ramsey numbers
• Regularity and Positional Games
• Positional Games
• Combinatorial Games
• On a combinatorial game

This page was built for publication: Strong Ramsey games: drawing on an infinite board