Skip to main content
1 of 2
Tony Huynh
  • 32.1k
  • 11
  • 112
  • 187

Yes, $(S_n, E_n)$ contains a Hamiltonian cycle for every $n \in \mathbb{N}$. This follows by the Steinhaus–Johnson–Trotter algorithm. The transpositions can even be chosen to be consecutive elements in the previous permutation.

Tony Huynh
  • 32.1k
  • 11
  • 112
  • 187