English

Almost Empty Monochromatic Triangles in Planar Point Sets

Combinatorics 2015-06-19 v2

Abstract

For positive integers c,s1c, 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 c3c\geq 3. In this paper we extend these results when c2c \geq 2 and s1s \geq 1. We prove that the least integer λ3(c)\lambda_3(c) such that M3(c,λ3(c))<M_3(c, \lambda_3(c))< \infty satisfies: c12λ3(c)c2,\left\lfloor\frac{c-1}{2}\right\rfloor \leq\lambda_3(c)\leq c-2, where c2c \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\lambda_3(4)=1, and verify it for sufficiently large Horton sets.

Cite

@article{arxiv.1410.0424,
  title  = {Almost Empty Monochromatic Triangles in Planar Point Sets},
  author = {Deepan Basu and Kinjal Basu and Bhaswar B. Bhattacharya and Sandip Das},
  journal= {arXiv preprint arXiv:1410.0424},
  year   = {2015}
}

Comments

Revised. 10 Pages, 2 figures. To appear in Discrete Applied Mathematics

R2 v1 2026-06-22T06:11:13.931Z