In a tournament with players {x1,...,xn}\{x_1, ..., x_n\}, a Hamiltonian path is a permutation of these players, {y1,...,yn}\{y_1, ..., y_n\} such that y1y_1 beats y2,y_2, y2y_2 beats y3,y_3, and so on.

In a tournament of five players numbered 11 through 5,5, which of the following pairs of permutations can simultaneously be Hamiltonian paths?

Choose all correct answers

Type a concept, like “slope” or “photosynthesis”.

↑ ↓ to choose · Enter to openSearch explanations and problems