On the Frankl-Rodl theorem

摘要

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.