On Hajnal's triangle-free game (Q1187952)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Hajnal's triangle-free game |
scientific article; zbMATH DE number 39888
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Hajnal's triangle-free game |
scientific article; zbMATH DE number 39888 |
Statements
On Hajnal's triangle-free game (English)
0 references
3 August 1992
0 references
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.
0 references
Hajnal's triangle-free game
0 references
0.9252302
0 references
0 references
0 references
0 references
0.83156824
0 references
