Minimum number of partial triangulations

From MaRDI portal




Abstract: We show that the number of partial triangulations of a set of n points on the plane is at least the (n2)-nd Catalan number. This is tight for convex n-gons. We also describe all the equality cases.









This page was built for publication: Minimum number of partial triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107503)