The Rational Number Game

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Bowler, Nathan, Gut, Florian
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916534464544768
author Bowler, Nathan
Gut, Florian
author_facet Bowler, Nathan
Gut, Florian
contents We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately claim unclaimed edges. It is Maker's goal to have after countably many turns a complete infinite graph contained in her coloured edges where the vertex set of the subgraph is order-isomorphic to the rationals. It is Breaker's goal to prevent Maker from achieving this. We prove that there is a winning strategy for Maker in this game. We also prove that there is a winning strategy for Breaker in the game where Maker must additionally make the vertex set of her complete graph dense in the rational numbers.
format Preprint
id arxiv_https___arxiv_org_abs_2309_05526
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle The Rational Number Game
Bowler, Nathan
Gut, Florian
Combinatorics
05C57, 05C55, 05C63,
We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately claim unclaimed edges. It is Maker's goal to have after countably many turns a complete infinite graph contained in her coloured edges where the vertex set of the subgraph is order-isomorphic to the rationals. It is Breaker's goal to prevent Maker from achieving this. We prove that there is a winning strategy for Maker in this game. We also prove that there is a winning strategy for Breaker in the game where Maker must additionally make the vertex set of her complete graph dense in the rational numbers.
title The Rational Number Game
topic Combinatorics
05C57, 05C55, 05C63,
url https://arxiv.org/abs/2309.05526