Connected, bounded degree, triangle avoidance games (Q640454): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Seress, Ákos / rank | |||
Property / author | |||
Property / author: Seress, Ákos / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:50, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connected, bounded degree, triangle avoidance games |
scientific article |
Statements
Connected, bounded degree, triangle avoidance games (English)
0 references
18 October 2011
0 references
Summary: We consider variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal a few years later. A graph game begins with two players and an empty graph on \(n\) vertices. The two players take turns choosing edges within \(K_n\), building up a simple graph. The edges must be chosen according to a set of restrictions \(\mathcal R\). The winner is the last player to choose an edge that does not violate any of the restrictions in \(\mathcal R\). For fixed \(n\) and \(\mathcal R\), one of the players has a winning strategy. For a pair of games where \(\mathcal R\) includes bounded degree, connectedness, and triangle-avoidance, we determine the winner for all values of \(n\).
0 references