English

Diameter-Ramsey triangles below the $135^\circ$

Combinatorics 2026-04-27 v1

Abstract

A finite Euclidean set is diameter-Ramsey if, for every number of colors, some finite same-diameter witness has the property that every coloring of the witness contains a monochromatic congruent copy of the set. Frankl, Pach, Reiher and R\"odl asked whether any obtuse triangle is diameter-Ramsey. We prove the stronger statement that every non-degenerate triangle whose largest angle is strictly smaller than 135135^\circ is diameter-Ramsey. Together with the theorem of Corsten and Frankl that triangles with an angle larger than 135135^\circ are not diameter-Ramsey, this gives the sharp classification for the two open angular ranges on either side of 135135^\circ. The proof uses a weighted kk-subset configuration with non-negative coefficients; a finite binary-tree construction realizes the required two prescribed overlaps, and the ordinary hypergraph Ramsey theorem then forces a monochromatic copy of the triangle.

Keywords

Cite

@article{arxiv.2604.22090,
  title  = {Diameter-Ramsey triangles below the $135^\circ$},
  author = {Yaping Mao},
  journal= {arXiv preprint arXiv:2604.22090},
  year   = {2026}
}

Comments

11 pages

R2 v1 2026-07-01T12:33:08.283Z