A lower bound on the diameter of the flip graph (Q521362)
From MaRDI portal
!
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 6703735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the diameter of the flip graph |
scientific article; zbMATH DE number 6703735 |
Statements
A lower bound on the diameter of the flip graph (English)
0 references
10 April 2017
0 references
Summary: The flip graph is the graph whose vertices correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained from one another by flipping a single edge. In this note we show that the diameter of the flip graph is at least \(\frac{7n}{3} + \Theta(1)\), improving upon the previous \(2n + \Theta(1)\) lower bound.
0 references
planar graphs
0 references
triangulations
0 references
flips
0 references
0.90293026
0 references
0 references
0 references
0.8835269
0 references
0.8807076
0 references
0.87533605
0 references
0.8744838
0 references
0 references
0.86830765
0 references
