Van der Waerden and Ramsey type games

DOI10.1007/BF02579267zbMath0519.05005OpenAlexW1988370884WikidataQ60361504 ScholiaQ60361504MaRDI QIDQ1054728

József Beck

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579267

zbMATH Keywords

games on hypergraphs2-player gameRamsey gamevan der Waerden game

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65) Games involving graphs (91A43)

Related Items (22)

A new bound for the Maker-Breaker triangle game ⋮ A note on biased and non-biased games ⋮ Hamiltonian cycles in bipartite graphs ⋮ A Hamiltonian game on \(K_{n,n}\) ⋮ An algorithmic approach to the Lovász local lemma. I ⋮ Mathematical problems and games ⋮ Deterministic Graph Games and a Probabilistic Intuition ⋮ Random strategies are nearly optimal for generalized van der Waerden games ⋮ Multistage positional games ⋮ Arithmetic Progressions and Tic-Tac-Toe Games ⋮ Upper bounds on positional Paris-Harrington games ⋮ A matching game ⋮ Strong Ramsey games in unbounded time ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ Avoider-enforcer: the rules of the game ⋮ On Ramsey-type positional games ⋮ The accelerated \(k\)-in-a-row game ⋮ A Winning Strategy for the Ramsey Graph Game ⋮ The pairing strategies of the 9-in-a-row game ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ Variations on a game ⋮ On chooser-picker positional games

Cites Work

• Unnamed Item
• On positional games
• Regularity and Positional Games
• Biased Positional Games
• A Solution of the Shannon Switching Game
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• On a combinatorial game

This page was built for publication: Van der Waerden and Ramsey type games