Almost Empty Monochromatic Triangles in Planar Point Sets
Combinatorics
2015-06-19 v2
Abstract
For positive integers , let be the least integer such that any set of at least points in the plane, no three on a line and colored with colors, contains a monochromatic triangle with at most interior points. The case , which corresponds to empty monochromatic triangles, has been studied extensively over the last few years. In particular, it is known that , and , for . In this paper we extend these results when and . We prove that the least integer such that satisfies: where . Moreover, the exact values of are determined for small values of and . We also conjecture that , 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