Winning fast in biased Maker-Breaker games

Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке: https://open.uns.ac.rs/handle/123456789/3047

Назив:	Winning fast in biased Maker-Breaker games
Аутори:	Mikalački (Rakić), Mirjana Stojaković, Mila
Датум издавања:	1-авг-2017
Часопис:	Electronic Notes in Discrete Mathematics
Сажетак:	© 2017 Elsevier B.V. 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 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.
URI:	https://open.uns.ac.rs/handle/123456789/3047
DOI:	10.1016/j.endm.2017.07.047
Налази се у колекцијама:	PMF Publikacije/Publications