Monochromatic equilateral triangles in the unit distance graph
Monochromatic equilateral triangles in the unit distance graph
Let χ Δ ( R n ) denote the minimum number of colors needed to color R n so that there will not be a monochromatic equilateral triangle with side length 1. Using the slice rank method, we reprove a result of Frankl and Rodl, and show that χ Δ …