The Speed and Threshold of the Biased Perfect Matching Game

MaRDI QIDQ6355551zbMATH OpenFDO

Authors Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce Cameron Reed, Ben Seamone

Publication date 8 December 2020

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Abstract: We show that Maker wins the Maker-Breaker perfect matching game in $fracn2+o(n)$ turns when the bias is at least $fracnlogn-fracf(n)n(logn{)}^{5/4}$, for any $f$ going to infinity with $n$ and $n$ sufficiently large (in terms of $f$).

This page was built for publication: The Speed and Threshold of the Biased Perfect Matching Game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355551)