Fast embedding of spanning trees in biased Maker-Breaker games

Details Fast embedding of spanning trees in biased Maker-Breaker games Fast embedding of spanning trees in biased Maker-Breaker games

2010-10-14

arxiv.org/abs/1010.2857v1

Mathematics

Combinatorics

20 pages

Scientific paper

Given a tree $T=(V,E)$ on $n$ vertices, we consider the $(1 : q)$ Maker-Breaker tree embedding game ${\mathcal T}_n$. The board of this game is the edge set of the complete graph on $n$ vertices. Maker wins ${\mathcal T}_n$ if and only if he is able to claim all edges of a copy of $T$. We prove that there exist real numbers $\alpha, \epsilon > 0$ such that, for sufficiently large $n$ and for every tree $T$ on $n$ vertices with maximum degree at most $n^{\epsilon}$, Maker has a winning strategy for the $(1 : q)$ game ${\mathcal T}_n$, for every $q \leq n^{\alpha}$. Moreover, we prove that Maker can win this game within $n + o(n)$ moves which is clearly asymptotically optimal.

Affiliated with

Also associated with

No associations

Rating

Fast embedding of spanning trees in biased Maker-Breaker games 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 embedding of spanning trees in biased Maker-Breaker games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast embedding of spanning trees in biased Maker-Breaker games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-285216