%0 Journal Article
%T Counting Carambolas
%A Adrian Dumitrescu
%A Maarten L£¿ffler
%A Andr¨¦ Schulz
%A Csaba D. T¨®th
%J Computer Science
%D 2014
%I arXiv
%R 10.1007/s00373-015-1621-7
%X 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.
%U http://arxiv.org/abs/1410.1579v2