Author:
CLEMENS DENNIS,FERBER ASAF,KRIVELEVICH MICHAEL,LIEBENAU ANITA
Abstract
In this paper we analyse classical Maker–Breaker games played on the edge set of a sparse random boardG~n,p. We consider the Hamiltonicity game, the perfect matching game and thek-connectivity game. We prove that forp(n) ≥ polylog(n)/nthe boardG~n,pis typically such that Maker can win these games asymptotically as fast as possible,i.e., withinn+o(n),n/2+o(n) andkn/2+o(n) moves respectively.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献