Paperlane

no. 17 · Wednesday 18 November 2026

Grundy Values of Node-Kayles on Level-Regular Trees

Nuttanon Songsuwan

math.CO · v2

Abstract

Node-Kayles is an impartial combinatorial game played on graphs, in which the two players alternately select a vertex and remove it together with all of its neighbours. By the Sprague–Grundy theorem, every position has a Grundy value that determines its outcome under optimal play. In this paper we study the Grundy values of Node-Kayles on level-regular trees $\T{a}$, $a=(a_1,\dots,a_d)$, in which every vertex at level $i-1$ has exactly $a_i$ children. We determine the Grundy values of all level-regular trees of depth at most two, show that $\G(\T{a})\le d+1$, and prove that $\G(\T{a})>0$ whenever $a_1a_2a_3$ is even, using an explicit mirror strategy. We prove a Leaf-Pair Lemma, which shows that the last branching parameter $a_d$ matters only through its parity, and a Twin Lemma for subgraphs that come in isomorphic pairs; as a consequence, $\G(\T{1,2k,s})=1$ for every $k\ge1$ and every finite sequence $s$. For trees containing a long run of ones, we give a general periodicity criterion: if the Grundy values of a tree with a pendant path of length $h$ are $34$-periodic on a finite window, then they are $34$-periodic for all larger $h$. This criterion extends to paths joining two fixed subtrees, and it explains the eventual periodicity of the families $\T{1^k,2}$ and $\T{2,1^k,2}$. We also show that, in this setting, eventual periodicity is equivalent to the boundedness of the Grundy values. Finally, supported by computations, we conjecture that the Grundy values are eventually periodic, with period $2$, in each branching parameter, and eventually periodic in the length of every run of ones.

fields
Combinatorics
pdf ↗ page arXiv:2512.24221 ↗