How long can a graph be kept planar? (Q1010669): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q170480 |
Changed an Item |
||
Property / author | |||
Property / author: Jack Scott Snoeyink / rank | |||
Normal rank |
Revision as of 10:07, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How long can a graph be kept planar? |
scientific article |
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