MAKER–BREAKER GAMES ON AND

From MaRDI portal
Publication:6103459




Abstract: We investigate Maker-Breaker games on graphs of size aleph1 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 Komega,omega1-game under ZFC+MA+egCH and a winning strategy for Breaker under ZFC+CH. We prove a similar result for the Komega1-game. Here, Maker has a winning strategy under ZF+DC+AD, while Breaker has one under ZFC+CH again.









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)