On saturated triangulation-free convex geometric graphs

David Garber, Chaya Keller, Olga Nissenbaum +1

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called…