Cutting corners

Abstract

We say that a subset $M$ of $R^n$ is exponentially Ramsey if there exists $\epsilon >0$ and $n_0$ such that $\chi (R^n,M)\ge {(1+\epsilon )}^n$ for any $n>n_0$, where $\chi (R^n,M)$ stands for the minimum number of colors in a coloring of $R^n$ such that no copy of $M$ is monochromatic. One important result in Euclidean Ramsey theory is due to Frankl and Rödl, and states the following (under some mild extra conditions): if both $N_1$ and $N_2$ are exponentially Ramsey then so is their Cartesian product. Applied several times to simple two-point sets $N_i$, this result implies that any subset $M$ of a ‘hyperrectangle’ $N_1\times \cdots \times N_k$ is exponentially Ramsey.

However, generally, such ‘embeddings’ of $M$ result in very inefficient bounds on the aforementioned ε. In this paper, we present another way of combining exponentially Ramsey sets, which gives much better estimates in some important cases. In particular, we show that the chromatic number of $R^n$ with a forbidden equilateral triangle satisfies $\chi (R^n,△)\ge {(1.0742...+o(1\left)\right)}^n$, greatly improving upon the previous constant 1.0144. We also obtain similar strong results for regular simplices of larger dimensions, as well as for related geometric Ramsey-type questions in Manhattan norm.

We then show that the same technique implies several interesting corollaries in other combinatorial problems. In particular, we give an explicit upper bound on the size of a family $F\subset 2^{\left[n\right]}$ that contains no weak k-sunflowers, i.e. no collection of k sets with pairwise intersections of the same size. This bound improves upon previously known results for all $k\ge 4$. Finally, we also present a simple deduction of the (other) celebrated Frankl–Rödl theorem from an earlier result of Frankl and Wilson. It gives probably the shortest known proof of Frankl and Rödl result with the most efficient bounds.