It is proved that each non-empty set of positive integers is the frequency set of a 3-partite tournament and such a tournament with minimal possible number of vertices is determined.