Fast strategies in Maker-Breaker games played on random boards

Details Fast strategies in Maker-Breaker games played on random boards Fast strategies in Maker-Breaker games played on random boards

2012-03-15

arxiv.org/abs/1203.3444v1

Mathematics

Combinatorics

Scientific paper

In this paper we analyze classical Maker-Breaker games played on the edge set of a sparse random board $G\sim \gnp$. We consider the Hamiltonicity game, the perfect matching game and the $k$-connectivity game. We prove that for $p(n)\geq \text{polylog}(n)/n$, the board $G\sim \gnp$ is typically such that Maker can win these games asymptotically as fast as possible, i.e. within $n+o(n)$, $n/2+o(n)$ and $kn/2+o(n)$ moves respectively.

Affiliated with

Also associated with

No associations

Rating

Fast strategies in Maker-Breaker games played on random boards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast strategies in Maker-Breaker games played on random boards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast strategies in Maker-Breaker games played on random boards will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-31956