Disjoint empty convex pentagons in planar point sets

In this paper we obtain the first non-trivial lower bound on the number of disjoint empty convex pentagons in planar points sets. We show that the number of disjoint empty convex pentagons in any set of n points in the plane, no three on a line, is at least \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\left\lfloor {\tfrac{{5n}} {{47}}} \right\rfloor $\end{document}. This bound can be further improved to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\tfrac{{3n - 1}} {{28}} $\end{document} for infinitely many n.