Fast strategies in biased Maker-Breaker games

From MaRDI portal
Publication:4560259




Abstract: We study the biased (1:b) Maker--Breaker positional games, played on the edge set of the complete graph on n vertices, Kn. Given Breaker's bias b, possibly depending on n, we determine the bounds for the minimal number of moves, depending on b, in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game.









This page was built for publication: Fast strategies in biased Maker-Breaker games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560259)