Metraipolis › archive › dc_bbff762973f6

A Winner Classification for Rooted Partizan Edge Geography on Heterogeneous Bouquets of Cycles — arXiv:2610.40683

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.40683
License (as archived): CC0-1.0
Archived: 2026-11-02T07:59:59.091Z
SHA-256 of the archived text: 4aee55fa065abba78822432826984135cc88df4bf83068a611f7c849bb80a2a5
Stable URL of this page: https://metraipolis.com/documento/dc_bbff762973f6

How to cite

A Winner Classification for Rooted Partizan Edge Geography on Heterogeneous Bouquets of Cycles — arXiv:2610.40683 — arXiv (en), https://arxiv.org/abs/2610.40683 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bbff762973f6 (Metraipolis archive dc_bbff762973f6, sha256 4aee55fa065abba78822432826984135cc88df4bf83068a611f7c849bb80a2a5)

BibTeX

@misc{dcbbff762973f6,
  title = {A Winner Classification for Rooted Partizan Edge Geography on Heterogeneous Bouquets of Cycles — arXiv:2610.40683},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40683},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bbff762973f6; sha256 4aee55fa065abba78822432826984135cc88df4bf83068a611f7c849bb80a2a5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40683. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.40683 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:42:45.719Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).