Ramsey games
From MaRDI portal
Publication:1598836
DOI10.1016/S0012-365X(01)00224-2zbMath1010.91013OpenAlexW2913369974MaRDI QIDQ1598836
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00224-2
Related Items (13)
Strong Ramsey games: drawing on an infinite board ⋮ Transitive avoidance games on boards of odd size ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ The Kℵ0$K^{\aleph _0}$ game: Vertex colouring ⋮ On the clique-game ⋮ Upper bounds on positional Paris-Harrington games ⋮ Online balanced graph avoidance games ⋮ Strong Ramsey games in unbounded time ⋮ Transitive avoidance games ⋮ Keeping avoider's graph almost acyclic ⋮ Winning Fast in Sparse Graph Construction Games ⋮ Weak and strong \(k\)-connectivity games ⋮ The star avoidance game
This page was built for publication: Ramsey games
