Empty Rainbow Triangles in k-colored Point Sets

07/15/2020
by   Ruy Fabila-Monroy, et al.
0

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 ≥ 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2020

Rainbow polygons for colored point sets in the plane

Given a colored point set in the plane, a perfect rainbow polygon is a s...
research
02/25/2020

A Note on Empty Balanced Tetrahedra in Two colored Point sets in ℝ^3

Let S be a set of n red and n blue points in general position in ℝ^3. Le...
research
08/18/2019

On sets of n points in general position that determine lines that can be pierced by n points

Let P be a set of n points in general position in the plane. Let R be a ...
research
11/06/2018

On the Number of Order Types in Integer Grids of Small Size

Let {p_1,...,p_n} and {q_1,...,q_n} be two sets of n labeled points in g...
research
11/24/2020

Realizing an m-uniform four-chromatic hypergraph with disks

We prove that for every m there is a finite point set 𝒫 in the plane suc...
research
11/06/2018

The Set-Maxima Problem in a Geometric Setting

In this paper we look at the classical set-maxima problem. We give a new...
research
12/09/2019

Algebraic k-sets and generally neighborly embeddings

Given a set S of n points in R^d, a k-set is a subset of k points of S t...

Please sign up or login with your details

Forgot password? Click here to reset