On a Frankl–Wilson Theorem

We derive an analog of the Frankl–Wilson theorem on independence numbers of some distance graphs. The obtained results are applied to the problem of the chromatic number of a space $\mathbb{R}^n$ with a forbidden equilateral triangle and to the problem of chromatic numbers of distance graphs with large girth.