Paperlane

no. 6 · Monday 2 November 2026

A Winner Classification for Rooted Partizan Edge Geography on Heterogeneous Bouquets of Cycles

Adam Tilèpe

math.CO · code · ∎ lean builds

Abstract

We consider an undirected edge-traversal game on a finite bouquet of simple cycles. Each of two players controls a token, both tokens begin at the common root, and the players alternate traversing edges that have not been used by either token. A player with no legal move loses. We prove that the first player wins precisely when the number of cycles of odd edge-length is odd, without assuming equal cycle lengths. The proof uses a simultaneous induction on root and defense configurations, with an exact analysis of the forced race between two opened cycles. We also explain how the classification corresponds to a completed Lean 4 formalization of the underlying game on finite edge sets.

code
github.com/adamtilepe/RootedTrailTrapHeterogeneousBouquets ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at f95b7ff, checked 2026-11-02 build details
comments
Complete Lean 4 formalization available at https://github.com/adamtilepe/RootedTrailTrapHeterogeneousBouquets
fields
Combinatorics
pdf ↗ page arXiv:2610.40683 ↗