Hitting time results for Maker‐Breaker games
Hitting time results for Maker‐Breaker games
Abstract We study Maker‐Breaker games played on the edge set of a random graph. Specifically, we analyze the moment a typical random graph process first becomes a Maker's win in a game in which Maker's goal is to build a graph which admits some monotone increasing property \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath,amssymb} …