On generalized exponents of tournaments

We determine two types of generalized exponent sets for tournaments with given order. In the course of proving the main results we find the following result, which may be interesting in its own right: When n is large enough, almost all tournaments on n vertices have the property that there is a C, path of length 2 from each vertex u to each vertex upsilon not equal u.