On Hajnal's triangle-free game (Q1187952): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximal triangle‐free graphs with restrictions on the degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4028471 / rank | |||
Normal rank | |||
Latest revision as of 10:15, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Hajnal's triangle-free game |
scientific article |
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
