How long can a graph be kept planar? (Q1010669)
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: How long can a graph be kept planar? |
scientific article; zbMATH DE number 5540876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How long can a graph be kept planar? |
scientific article; zbMATH DE number 5540876 |
Statements
How long can a graph be kept planar? (English)
0 references
7 April 2009
0 references
Summary: The graph (non-)planarity game is played on the complete graph \(K_n\) between an Enforcer and an Avoider, each of whom take one edge per round. The game ends when the edges chosen by Avoider form a non-planar subgraph. We show that Avoider can play for \(3n-26\) turns, improving the previous bound of \(3n-28\sqrt n\).
0 references
0.8105489611625671
0 references
0.8103013634681702
0 references
0.7925689220428467
0 references
0.7768990397453308
0 references
0.7768381834030151
0 references
