A lower bound on the diameter of the flip graph (Q521362)

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.