On the Frankl–Rödl theorem. (December 2018) - Sagdeev, A. A.
Abstract: In this paper we considerably strengthen the currently known explicit exponential lower bound for the chromatic number of a Euclidean space with a forbidden regular simplex. We also strengthen the exponential lower bound for the chromatic numbers of distance graphs with large girth.