On the threshold for the Maker‐Breaker <i>H</i>‐game
On the threshold for the Maker‐Breaker <i>H</i>‐game
Abstract We study the Maker‐Breaker H ‐game played on the edge set of the random graph . In this game two players, Maker and Breaker, alternately claim unclaimed edges of , until all edges are claimed. Maker wins if he claims all edges of a copy of a fixed graph …