Almost Empty Monochromatic Triangles in Planar Point Sets

preprint2015arXivOpen access

Abstract

For positive integers c,s≥1c, s \geq 1, let M3(c,s)M_3(c, s) be the least integer such that any set of at least M3(c,s)M_3(c, s) points in the plane, no three on a line and colored with cc colors, contains a monochromatic triangle with at most ss interior points. The case s=0s=0, which corresponds to empty monochromatic triangles, has been studied extensively over the last few years. In particular, it is known that M3(1,0)=3M_3(1, 0)=3, M3(2,0)=9M_3(2, 0)=9 and M3(c,0)=∞M_3(c, 0)=\infty, for c≥3c\geq 3. In this paper we extend these results when c≥2c \geq 2 and s≥1s \geq 1. We prove that the least integer λ3(c)λ_3(c) such that M3(c,λ3(c))<∞M_3(c, λ_3(c))< \infty satisfies: ⌊c−12⌋≤λ3(c)≤c−2,\left\lfloor\frac{c-1}{2}\right\rfloor \leqλ_3(c)\leq c-2, where c≥2c \geq 2. Moreover, the exact values of M3(c,s)M_3(c, s) are determined for small values of cc and ss. We also conjecture that λ3(4)=1λ_3(4)=1, and verify it for sufficiently large Horton sets.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.