Show that for sufficiently large primes , there is an Eulerian circuit on the complete graph with vertices that does not contain any cycles of length at most .
Problem 920
Official solution
Solution:
Take a generator so that is not equivalent to anything of the form for integers . For big enough primes, such a must exist as there are at most a constant number of such fractions.
Now number the vertices with the residues . For any residue , consider the sequence of vertices formed by the multiples of , starting from and ending at . We claim that the concatenation of works.
Clearly no contains a cycle. Thus, if a cycle were to exist, it would have to be formed by the end of one and the start of another. In other words, we would have for . However, this is impossible by choice of .