Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2110.08738

The Game of Arrows on 3-Legged Spider Graphs

Bryant G. Mathews
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Game of Cycles is a combinatorial game introduced by Francis Su in 2020 in which players take turns marking arrows on the edges of a simple plane graph, avoiding the creation of sinks and sources and seeking to complete a "cycle cell." Su and his collaborators (2021) found winning strategies on graphs with certain types of symmetry using reverse mirroring. In this paper, we for the first time determine the winning player in the Game of Cycles on an infinite family of graphs lacking symmetry. In particular, we use the Sprague-Grundy Theorem to show that player two has a winning strategy for the Game of Cycles on any 3-legged spider graph with legs of odd length. Because the cycle cell victory condition is extraneous for tree graphs (including spiders), we drop it from the rules and call the result the Game of Arrows. Our proof leans heavily on a notion of state isomorphism that allows us to decompose a game state into states of smaller pieces of a graph, leading to nim-sum calculations with Grundy values.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bryant G. Mathews. 2022-05-29. The Game of Arrows on 3-Legged Spider Graphs. https://arxiv.org/abs/2110.08738

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗