1 paper
Asaf Ferber, Roman Glebov, Michael Krivelevich +4
In this paper we consider biased Maker-Breaker games played on the edge set of a given graph G. We prove that for every δ>0 and large enough n, there exists a constant k fo…