Asymptotically Optimal Threshold Bias for the $(a:b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games

Adnane Fouadi, Mourad El Ouali, Anand Srivastav

We study the $(a:b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_n$ on $n$ vertices, $n,a,b\in \mathbb{N}$ where the goal of Maker is to build a copy…