Monochromatic Equilateral Triangles in the Unit Distance Graph

Abstract

Let ${\chi }_{\Delta }({\mathbb{R}}^n)$ denote the minimum number of colors needed to color ${\mathbb{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 ${\chi }_{\Delta }\left({\mathbb{R}}^n\right)$ grows exponentially with $n$. This technique substantially improves upon the best known quantitative lower bounds for ${\chi }_{\Delta }\left({\mathbb{R}}^n\right)$, and we obtain \[ χ_Δ\left(\mathbb{R}^{n}\right)>(1.01446+o(1))^{n}. \]

arXiv comment4 pages

References in corpus (7)

• Progression-free sets in Z_4^n are exponentially small
• On cap sets and the group-theoretic approach to matrix multiplication
• Upper bounds for sunflower-free sets
• The Partition Rank of a Tensor and $k$-Right Corners in ${\mathbb{F}}_q^n$
• The chromatic number of the plane is at least 5
• Exponential Bounds for the Erdős-Ginzburg-Ziv Constant
• Maximum subsets of ${\mathbb{F}}_q^n$ containing no right angles

Cited by in corpus (5)

• All finite sets are Ramsey in the maximum norm
• Two-colorings of normed spaces without long monochromatic unit arithmetic progressions
• Max-norm Ramsey Theory
• Cutting corners
• A recursive Lovász theta number for simplex-avoiding sets