MAKER–BREAKER GAMES ON AND

DOI10.1017/JSL.2022.49arXiv2201.08681MaRDI QIDQ6103459FDOQ6103459

Authors: Nathan Bowler, Attila Joó, Max F. Pitz 

Publication date: 5 June 2023

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Abstract: We investigate Maker-Breaker games on graphs of size $alep{h}_1$ 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 $K_{omega,omeg{a}_1}$-game under ZFC+MA+$eg$CH and a winning strategy for Breaker under ZFC+CH. We prove a similar result for the $K_{omeg{a}_1}$-game. Here, Maker has a winning strategy under ZF+DC+AD, while Breaker has one under ZFC+CH again.

Full work available at URL: https://arxiv.org/abs/2201.08681

zbMATH Keywords

games on graphsaxiom of choiceMartin's axiomtwo-player gameaxiom of determinacymaker-breaker gamecomplete uncountable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Infinite graphs (05C63) Other combinatorial set theory (03E05) Ramsey theory (05D10)

Cites Work

• Set Theory
• Biased positional games on matroids
• Biased Positional Games
• A Solution of the Shannon Switching Game
• Set theory.
• The higher infinite. Large cardinals in set theory from their beginnings.
• \(\omega_1\) can be measurable
• Maker-breaker percolation games. II: Escaping to infinity
• Title not available (Why is that?)
• Bases in Infinite Matroids
• Bounding 2d functions by products of 1d functions

Cited In (2)

• Maker-breaker percolation games. II: Escaping to infinity
• Title not available (Why is that?)

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)