Almost empty monochromatic triangles in planar point sets

Abstract: For positive integers

c, s g e q 1

, let

M_{3} (c, s)

be the least integer such that any set of at least

M_{3} (c, s)

points in the plane, no three on a line and colored with

c

colors, contains a monochromatic triangle with at most

s

interior points. The case

s = 0

, which corresponds to empty monochromatic triangles, has been studied extensively over the last few years. In particular, it is known that

M_{3} (1, 0) = 3

,

M_{3} (2, 0) = 9

and

M_{3} (c, 0) = i n f t y

, for

c g e q 3

. In this paper we extend these results when

c g e q 2

and

s g e q 1

. We prove that the least integer

l a m b d a_{3} (c)

such that

M_{3} (c, l a m b d a_{3} (c)) < i n f t y

satisfies:

leftlfloorfrac{c-1}{2} ight floor leqlambda_3(c)leq c-2,

where

c g e q 2

. Moreover, the exact values of

M_{3} (c, s)

are determined for small values of

c

and

s

. We also conjecture that

l a m b d a_{3} (4) = 1

, and verify it for sufficiently large Horton sets.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Almost empty monochromatic triangles in planar point sets