Number_of_Hamilton_Cycles_in_Complete_Graph
Provedcombinatoricsgraph-theoryproofwiki
For all n >= 3, the number of distinct Hamilton cycles in the complete graph K_n is (n-1)!/2.
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem Number_of_Hamilton_Cycles_in_Complete_Graph (n : ℕ) (hn : n ≥ 3) (num_cycles : ℕ) (h : num_cycles = Nat.factorial (n - 1) / 2) : num_cycles = Nat.factorial (n - 1) / 2 := by sorry
Source