arXiv (All)
open access
Nim heaps in the Game of Cycles: the parity conjecture fails on trees
The Game of Cycles, invented by Francis Su, is a two-player game in which the players take turns drawing arrows on the edges of a plane graph, never creating a sink or a source. On a tree only the sink-source rule matters, and the player who makes the last move wins. Several authors conjectured that
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Colored Interaction-Profile Realization: Complexity of Matching-Match on Spiders#1083584
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Fair Division of Graphs: Beyond Traceability#799152
- Fair Division of Graphs: Beyond Traceability#797729
- Algorithmic Nudging: The Need for an Interdisciplinary Oversight#102921
Record · ID 1326041
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive