Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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  show that the diameter of the flip graph is at least $\frac{7n}{3} + \Theta(1)$, improving upon the previous $2n + \Theta(1)$ lor bound.
['Fabrizio Frati']
I am writing a research paper on a idea A Lower Bound on the Diameter of the Flip Graph
[{"from": "human", "value": "I am writing a research paper on a idea A Lower Bound on the Diameter of the Flip Graph"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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  show that the diameter of the flip graph is at least $\\frac{7n}{3} + \\Theta(1)$, improving upon the previous $2n + \\Theta(1)$ lor bound."}]