Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.20505

The Closed Geodetic Game: algorithms and strategies

Antoine Dailly·Harmender Gahlawat·Zin Mar Myint
View original source ↗Read source document ↗Export metadata ↓

Abstract

The geodetic closure of a set S of vertices of a graph is the set of all vertices in shortest paths between pairs of vertices of S. A set S of vertices in a graph is geodetic if its geodetic closure contains all the vertices of the graph. Several authors have studied variants of games around constructing geodetic sets. The most studied of those, the Geodetic Game, was introduced by Harary in 1984 and developed by Buckley and Harary in 1985. It is an achievement game: both players construct together a geodetic set by alternately adding vertices to the set, the winner being the one who plays last. However, this version of the game allows the players to select vertices that already are in the geodetic closure of the current set. We study the more natural variant, called the Closed Geodetic Game, where the players alternate adding to S vertices that are not in the geodetic closure of S. This variant was also introduced in another, less-noticed, paper by Buckley and Harary in 1985, and only studied since then in the context of trees by Araujo et al. in 2024. We provide a full characterization of the Sprague-Grundy values (equivalence values for games) of graph classes such as paths and cycles, of the outcomes of the Cartesian product of several graphs in function of their individual outcomes, and give polynomial-time algorithms to determine the Sprague-Grundy values in cactus and block graphs.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antoine Dailly, Harmender Gahlawat, Zin Mar Myint. 2026-08-04. The Closed Geodetic Game: algorithms and strategies. https://arxiv.org/abs/2409.20505

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

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗