I want to solve the next exercise of graph theory:
Prove that a transitive tournament contains a Hamilton path with any preassigned orientation
My problem is that I don't understand what the exercise means by 'any preassigned orientation'. I do not know what I must prove...