Name
Abstract | ||
|---|---|---|
We show that there is an $m=2n+o(n)$, such that, in the Maker-Breaker game
played on $\Z^d$ where Maker needs to put at least $m$ of his marks
consecutively in one of $n$ given winning directions, Breaker can force a draw
using a pairing strategy. This improves the result of Kruczek and Sundberg who
showed that such a pairing strategy exits if $m\ge 3n$. A simple argument shows
that $m$ has to be at least $2n+1$ if Breaker is only allowed to use a pairing
strategy, thus the main term of our bound is optimal. |
Year | Venue | Field |
|---|---|---|
2010 | Electr. J. Comb. | Discrete mathematics,Combinatorics,Pairing,Mathematics |
DocType | Volume | Issue |
Journal | 17 | 1 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Padmini Mukkamala | 1 | 35 | 3.19 |
| Dömötör Pálvölgyi | 2 | 202 | 29.14 |