The Speed and Threshold of the Biased Perfect Matching Game.
2020
We show that Maker wins the Maker-Breaker perfect matching game in $\frac{n}{2}+o(n)$ turns when the bias is at least $\frac{n}{\log{n}}-\frac{f(n)n}{(\log{n})^{5/4}}$, for any $f$ going to infinity with $n$ and $n$ sufficiently large (in terms of $f$).
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
7
References
1
Citations
NaN
KQI