The star avoidance game

MaRDI QIDQ3300714zbMATH OpenFDO

Authors Adrian Beker

Publication date 29 July 2020

Full work available at URL https://arxiv.org/abs/2001.06735, http://ajc.maths.uq.edu.au/pdf/77/ajc_v77_p398.pdf

zbMATH Keywords

\((k+1)\)-star avoidance gamesim-like games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Abstract: Let $n,k$ be positive integers. The $(k+1)$-star avoidance game on $K_n$ is played as follows. Two players take it in turn to claim a (previously unclaimed) edge of the complete graph on $n$ vertices. The first player to claim all edges of a subgraph isomorphic to a $(k+1)$-star loses. Equivalently, each player must keep all degrees in the subgraph formed by his edges at most $k$. If all edges have been chosen and neither player has lost, the game is declared a draw. We prove that, for each fixed $k$, the game is a win for the second player for all $n$ sufficiently large.

Recommendations

• Avoider-enforcer star games
• Avoider-enforcer star games
• Bounded degree, triangle avoidance graph games
• scientific article; zbMATH DE number 3900800
• Connected, bounded degree, triangle avoidance games

Cites work

• Combinatorial Games
• Ramsey games

Cited in

(5)

• On strong avoiding games
• Bounded degree, triangle avoidance graph games
• scientific article; zbMATH DE number 7379291 (Why is no real title available?)
• Avoider-enforcer star games
• Avoider-enforcer star games

This page was built for publication: The star avoidance game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300714)