arXiv (All)
open access
A Linear-Time Algorithm for the Unbiased Claw Game on Graphs with Maximum Degree 4
We study the unbiased Maker-Breaker $K_{1,3}$-game, the unbiased claw game, played on the edge set of a general graph $G$. In this game, Maker and Breaker alternatingly claim edges of $G$, and Maker wins if his claimed edges contain a claw once no more edges are available. Graphs with maximum degree
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
- Nim heaps in the Game of Cycles: the parity conjecture fails on trees#1326041
- За игрой в карты с чертиком Визинга#71568
- Near-optimal edge partitioning via intersecting families#1141416
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Fair Division of Graphs: Beyond Traceability#799152
Record · ID 1357533
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