Strong games played on random graphs

Asaf Ferber, Pascal Pfister

In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). Th…