Probabilistic intuition holds for a class of small subgraph games

Abstract

Consider the following two-player game on the edges of K n K_n , the complete graph with n n vertices: Starting with an empty graph G G on the vertex set of K n K_n , in each round the first player chooses b ∈ N b \in \mathbb {N} edges from K n K_n which have not previously been chosen, and the second player immediately and irrevocably picks one of these edges and adds it to G G . We show that for any graph H H with at least one edge, if b > c n 1 / m ( H ) b > c n^{1/m(H)} , where c = c ( H ) > 0 c = c(H) > 0 only depends on H H and m ( H ) m(H) is the usual density function, then the first player can ensure the resulting graph G G contains Ω ( n v ( H ) / b e ( H ) ) \Omega (n^{v(H)} / b^{e(H)}) copies of H H . The bound on b b is the best possible apart from the constant c c and shows that the density of the resulting graph for which it is possible to enforce the appearance of H H coincides with a threshold for the appearance in the Erdős-Rényi random graph. This resolves a conjecture by Bednarska-Bzdȩga, Hefetz, and Łuczak [J. Combin. Theory Ser. B 119 (2016), pp. 122–154] and provides a prominent class of games for which probabilistic intuition accurately predicts the outcome. The strategy of the first player is deterministic with polynomial running time, with the degree depending on the size of H H .