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条给他看

懂了 谢谢!