Circulant tournaments of prime order are tight

We say that a tournament is tight if for every proper 3-coloring of its vertex set there is a directed cyclic triangle whose vertices have different colors. In this paper, we prove that all circulant tournaments with a prime number p≥3p≥3 of vertices are tight using results relating to the acyclic disconnection of a digraph and theorems of additive number theory.