4.(a)
Prove that a complete graph Kn(下標n), where n≧3 being a prime number,
can have its edges partitioned into 1/2*(n-1) disjoint Hamilton circuits.
請問這一題要怎麼證明呢? 謝謝!

（n,2）/n

先證明最多(n-1)/2條 在畫出來（n-1)/2條給他看

懂了 謝謝!