The topology of competitively constructed graphs (Q405221)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6340193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The topology of competitively constructed graphs |
scientific article; zbMATH DE number 6340193 |
Statements
The topology of competitively constructed graphs (English)
0 references
4 September 2014
0 references
Summary: We consider a simple game, the \(k\)-regular graph game, in which players take turns adding edges to an initially empty graph subject to the constraint that the degrees of vertices cannot exceed \(k\). We show a sharp topological threshold for this game: for the case \(k=3\)~a player can ensure the resulting graph is planar, while for the case \(k=4\), a player can force the appearance of arbitrarily large clique minors.
0 references
combinatorial games
0 references
planar graphs
0 references
graph minors
0 references
0.8142729997634888
0 references
0.7656656503677368
0 references
0.7596064805984497
0 references
0.7547048926353455
0 references
0.7518896460533142
0 references
