Abstract
We investigate the triangle-free game proposed by András Hajnal. Starting with the empty graph onn points, two players alternatingly pick edges. The loser is the player who is forced to select an edge which completes a triangle. We determine the winner in a version of the game with the additional rule that the chosen edges must always give a connected subgraph ofK n . Some other versions are also investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Erdös, P.: Personal communication.
Füredi, Z., Seress, Á.: Maximal triangle-free graphs with restrictions on the degrees, submitted.
Füredi, Z., Reimer, D., Seress, Á.: Hajnal's triangle-free game and extremal graph problems.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Seress, Á. On Hajnal's triangle-free game. Graphs and Combinatorics 8, 75–79 (1992). https://doi.org/10.1007/BF01271710
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01271710