A Lower Bound on the Diameter of the Flip Graph
Computational Geometry
2015-08-17 v1 Data Structures and Algorithms
Combinatorics
Abstract
The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that the diameter of the flip graph is at least , improving upon the previous lower bound.
Keywords
Cite
@article{arxiv.1508.03473,
title = {A Lower Bound on the Diameter of the Flip Graph},
author = {Fabrizio Frati},
journal= {arXiv preprint arXiv:1508.03473},
year = {2015}
}