On Hajnal's triangle-free game (Q1187952)

The following game, proposed by A. Hajnal, is investigated: From two players who alternatively pick edges of a graph on \(n\) points (starting with an empty graph) the loser is the one who picks an edge which completes a triangle. The main result of the paper is the analysis of a version of the game with the additional rule that the chosen edges must always give a connected subgraph of \(K_ n\). Two other versions are also investigated.