betaFeedback

WorksMathematics

Almost Empty Monochromatic Triangles With Many Colors

Abstract

Given integers c≥2c\geq 2 and s≥0s\geq 0, let M3(c,s)\mathsf{M}_3(c,s) denote the least integer such that every set of at least M3(c,s)\mathsf{M}_3(c,s) points in the plane, no three on a line, colored with cc colors, contains a monochromatic triangle with at most ss interior points. Further, let λ3(c)λ_3(c) be the least integer such that M3(c,λ3(c))<∞\mathsf{M}_3(c,λ_3(c))<\infty. \citet{colorempty} proved that, for every c≥2c\geq 2, ⌊c−12⌋≤λ3(c)≤c−2.\left\lfloor\frac{c-1}{2}\right\rfloor \leq λ_3(c)\leq c-2. Later, \citet{cravioto2019almost} improved the upper bound to c−3c-3, for c≥4c\geq 4. In this paper, we refine their argument to obtain the following asymptotic improvement: λ3(c)≤c−clog⁡c+o(clog⁡c),λ_3(c) \leq c-\sqrt{c\log c}+o (\sqrt{c\log c} ), for all sufficiently large cc. We also show that every cc-coloring of a sufficiently large Horton set contains a monochromatic triangle with at most ⌊c−12⌋\lfloor \frac{c-1}{2} \rfloor interior points. This shows that the aforementioned lower bound on λ3(c)λ_3(c) is sharp within the class of Horton sets. We conclude with a conjecture on the large-color asymptotics of λ3(c)λ_3(c).

Paper details

vlnc:W_mdefpf6f
Version
v2 · latest
Published
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…