Empty Rainbow Triangles in k-colored Point Sets

Let $S$ be a set of $n$ points in general position in the plane. Suppose that each point of $S$ has been assigned one of $k \ge 3$ possible colors and that there is the same number, $m$, of points of each color class. A polygon with vertices on $S$ is empty if it does not contain points of $S$ in its interior; and it is rainbow if all its vertices have different colors. Let $f(k,m)$ be the minimum number of empty rainbow triangles determined by $S$. In this paper we give tight asymptotic bounds for this function. Furthermore, we show that $S$ may not determine an empty rainbow quadrilateral for some arbitrarily large values of $k$ and $m$.

[1]  Ruy Fabila Monroy,et al.  Empty monochromatic triangles , 2009, Comput. Geom..

[2]  Jorge Urrutia,et al.  Balanced 6-holes in linearly separable bichromatic point sets , 2013, Electron. Notes Discret. Math..

[3]  Carlos M. Nicolas.  The Empty Hexagon Theorem , 2007, Discret. Comput. Geom..

[4]  Sergey Bereg,et al.  On balanced 4-holes in bichromatic point sets , 2015, Comput. Geom..

[5]  A. Meir,et al.  On empty triangles determined by points in the plane , 1988 .

[6]  Adrian Dumitrescu.  Planar sets with few empty convex polygons , 1998, CCCG.

[7]  Tobias Gerken.  Empty Convex Hexagons in Planar Point Sets , 2008, Discret. Comput. Geom..

[8]  I. Bárány,et al.  Empty Simplices in Euclidean Space , 1987, Canadian Mathematical Bulletin.

[10]  Pavel Valtr.  Convex independent sets and 7-holes in restricted planar point sets , 1992, Discret. Comput. Geom..

[11]  L. Liu,et al.  Almost Empty Monochromatic Quadrilaterals in Planar Point Sets , 2018 .

[12]  Kinjal Basu,et al.  Almost empty monochromatic triangles in planar point sets , 2016, Discret. Appl. Math..

[13]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[14]  J. Horton.  Sets with No Empty Convex 7-Gons , 1983, Canadian Mathematical Bulletin.

[15]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[16]  G. Fejes Tóth.  PLANAR POINT SETS WITH A SMALL NUMBER OF EMPTY CONVEX POLYGONS , 2004 .

[17]  Alexander Pilz,et al.  Lower Bounds for the Number of Small Convex k-Holes , 2014, CCCG.

[18]  A Note on the Number of Empty Triangles , 2011, EGC.

[19]  János Pach,et al.  Monochromatic empty triangles in two-colored point sets , 2013, Discret. Appl. Math..

[20]  Knut Dehnhardt.  Leere konvexe Vielecke in ebenen Punktmengen , 1987 .

[21]  Olivier Devillers,et al.  Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position , 2003, Comput. Geom..

[22]  P. Valtr.  On the minimum number of empty polygons in planar point sets , 1992 .

[23]  Heiko Harborth.  Konvexe Fünfecke in ebenen Punktmengen. , 1978 .

[24]  Ferran Hurtado,et al.  Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons , 2010, SIAM J. Discret. Math..