The Speed and Threshold of the Biased Perfect Matching Game

Noah Brustle, Sarah Clusiau, Vishnu V. Narayan +3

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$…