Constructions for positional games and applications to domination games
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912573227532288 |
|---|---|
| author | Bagdas, Ali Deniz Clemens, Dennis Hamann, Fabian Mogge, Yannick |
| author_facet | Bagdas, Ali Deniz Clemens, Dennis Hamann, Fabian Mogge, Yannick |
| contents | We present constructions regarding the general behaviour of biased positional games, and amongst others show that the outcome of such a game can differ in an arbitrary way depending on which player starts the game, and that fair biased games can behave highly non-monotonic. We construct a gadget that helps to transfer such results to Maker-Breaker domination games, and by this we extend a recent result by Gledel, Iršič, and Klavžar, regarding the length of such games. Additionally, we introduce Waiter-Client dominations games, give tight results when they are played on trees or cycles, and using our transference gadget we show that in general the length of such games can differ arbitrarily from the length of their Maker-Breaker analogue. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_05089 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Constructions for positional games and applications to domination games Bagdas, Ali Deniz Clemens, Dennis Hamann, Fabian Mogge, Yannick Combinatorics 05C57 (Primary) 05C69 (Secondary) We present constructions regarding the general behaviour of biased positional games, and amongst others show that the outcome of such a game can differ in an arbitrary way depending on which player starts the game, and that fair biased games can behave highly non-monotonic. We construct a gadget that helps to transfer such results to Maker-Breaker domination games, and by this we extend a recent result by Gledel, Iršič, and Klavžar, regarding the length of such games. Additionally, we introduce Waiter-Client dominations games, give tight results when they are played on trees or cycles, and using our transference gadget we show that in general the length of such games can differ arbitrarily from the length of their Maker-Breaker analogue. |
| title | Constructions for positional games and applications to domination games |
| topic | Combinatorics 05C57 (Primary) 05C69 (Secondary) |
| url | https://arxiv.org/abs/2509.05089 |