On the odd cycle game and connected rules

DOI10.1016/j.ejc.2020.103140zbMath1447.05133arXiv1906.04024OpenAlexW3027850464MaRDI QIDQ2198973

Christoph Spiegel, Adva Mond, Tibor Szabó, Jan Corsten, Alexey Pokrovskiy

Publication date: 15 September 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

maker-breaker gameclient-waiter game

Mathematics Subject Classification ID

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

Related Items (2)

Waiter-client triangle-factor game on the edges of the complete graph ⋮ Connector-breaker games on random boards

Cites Work

• Waiter-Client and Client-Waiter planarity, colorability and minor games
• Picker-chooser fixed graph games
• Creating cycles in walker-breaker games
• On the Chvàtal-Erdős triangle game
• Avoider-enforcer: the rules of the game
• Biased positional games on matroids
• Positional games and the second moment method
• Keeping avoider's graph almost acyclic
• Avoider-Enforcer games
• Odd and even cycles in maker-breaker games
• Positional games
• Walker-Breaker Games
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Planarity, Colorability, and Minor Games
• Biased Positional Games
• Manipulative Waiters with Probabilistic Intuition
• Combinatorial Games
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: On the odd cycle game and connected rules