Deduction with $k$ moves
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908618562994176 |
|---|---|
| author | Burgess, Andrea C. Clarke, Nancy E. Fitzpatrick, Shannon L. Huggan, Melissa A. |
| author_facet | Burgess, Andrea C. Clarke, Nancy E. Fitzpatrick, Shannon L. Huggan, Melissa A. |
| contents | The deduction game may be thought of as a variant on the classical game of cops and robber in which the cops (searchers) aim to capture an invisible robber (evader); each cop is allowed to move at most once, and cops situated on different vertices cannot communicate to co-ordinate their strategy. In this paper, we extend the deduction game to allow each searcher to make $k$ moves, where $k$ is a fixed positive integer. We consider the value of the $k$-move deduction number on several classes of graphs including paths, cycles, complete graphs, complete bipartite graphs, and Cartesian and strong products of paths. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_24959 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Deduction with $k$ moves Burgess, Andrea C. Clarke, Nancy E. Fitzpatrick, Shannon L. Huggan, Melissa A. Combinatorics 05C57 The deduction game may be thought of as a variant on the classical game of cops and robber in which the cops (searchers) aim to capture an invisible robber (evader); each cop is allowed to move at most once, and cops situated on different vertices cannot communicate to co-ordinate their strategy. In this paper, we extend the deduction game to allow each searcher to make $k$ moves, where $k$ is a fixed positive integer. We consider the value of the $k$-move deduction number on several classes of graphs including paths, cycles, complete graphs, complete bipartite graphs, and Cartesian and strong products of paths. |
| title | Deduction with $k$ moves |
| topic | Combinatorics 05C57 |
| url | https://arxiv.org/abs/2510.24959 |