2000 character limit reached
Counting Carambolas (1410.1579v2)
Published 6 Oct 2014 in math.CO and cs.DM
Abstract: We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons}, \emph{star-shaped polygons} and \emph{monotone paths}. We also consider related problems for \emph{directed} planar straight-line graphs.