MAKER–BREAKER GAMES ON AND
From MaRDI portal
Publication:6103459
Abstract: We investigate Maker-Breaker games on graphs of size in which Maker's goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the game on the axiomatic framework. Relating to this, we prove that there is a winning strategy for Maker in the -game under ZFC+MA+CH and a winning strategy for Breaker under ZFC+CH. We prove a similar result for the -game. Here, Maker has a winning strategy under ZF+DC+AD, while Breaker has one under ZFC+CH again.
Cites work
- scientific article; zbMATH DE number 3791974 (Why is no real title available?)
- A Solution of the Shannon Switching Game
- Bases in Infinite Matroids
- Biased Positional Games
- Biased positional games on matroids
- Bounding 2d functions by products of 1d functions
- Maker-breaker percolation games. II: Escaping to infinity
- Set Theory
- Set theory.
- The higher infinite. Large cardinals in set theory from their beginnings.
- \(\omega_1\) can be measurable
Cited in
(2)
This page was built for publication: MAKER–BREAKER GAMES ON AND
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103459)