ON HAJNAL TRIANGLE-FREE GAME

被引：16

作者：

SERESS, A ^{[1
]}

机构：

[1] OHIO STATE UNIV,COLUMBUS,OH 43210

来源：

GRAPHS AND COMBINATORICS | 1992年 / 8卷 / 01期

关键词：

D O I：

10.1007/BF01271710

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We investigate the triangle-free game proposed by Andras Hajnal. Starting with the empty graph on n 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 of K(n). Some other versions are also investigated.

引用

页码：75 / 79

页数：5