An upper bound on the extremal version of Hajnal's triangle-free game

Csaba Biró, Paul Horn, D. Jacob Wildstrom

A game starts with the empty graph on $n$ vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a ma…