Probabilistic intuition holds for a class of small subgraph games

TL;DR

This paper proves that in a specific class of small subgraph games, the first player can enforce the appearance of a fixed subgraph with high probability, aligning with probabilistic predictions and resolving a conjecture.

Contribution

It establishes the threshold for the first player's ability to force a subgraph in a game, confirming probabilistic intuition and resolving a conjecture in the field.

Findings

First player can ensure many copies of H if b is below a certain threshold.

The threshold matches the Erdős-Rényi random graph appearance threshold.

The first player's strategy is deterministic and polynomial-time.

Abstract

Consider the following two-player game on the edges of $K_n$, the complete graph with $n$ vertices: Starting with an empty graph $G$ on the vertex set of $K_n$, in each round the first player chooses $b \in \mathbb{N}$ edges from $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$. We show that for any graph $H$ with at least one edge, if $b < c n^{1/m(H)}$, where $c = c(H) > 0$ only depends on $H$ and $m(H)$ is the usual density function, then the first player can ensure the resulting graph $G$ contains $\Omega(n^{v(H)} / b^{e(H)})$ copies of $H$. The bound on $b$ is the best possible apart from the constant $c$ and shows that the density of the resulting graph for which it is possible to enforce the appearance of $H$ coincides with a threshold for the appearance in the Erd\H{o}s-R\'enyi random graph. This resolves a conjecture by Bednarska-Bzd\c{e}ga, Hefetz, and Luczak 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$.