arXiv (OAI Expanded)
open access
Impartial removing games on grid graphs
A subset of the vertex set of a graph is geodetically convex if it contains every vertex on any shortest path between two elements of the subset. The convex hull of a set of vertices is the smallest convex set containing the set. We study two games in which two players take turns selecting vertices
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
- Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes#319653
- On Tournament Anti-Sidorenko Orientations of Trees#1062650
- Fractional clique decompositions in random hypergraphs#1078014
- Dynamic Edge Coloring of Forests#785160
- Dynamic Edge Coloring of Forests#783570
Record · ID 1084015
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