Let n Z+, with n 9. Prove that if the edges of Kn can be

Question:

Let n ∈ Z+, with n ≥ 9. Prove that if the edges of Kn can be partitioned into subgraphs isomorphic to cycles of length 4 (where any two such cycles share no common edge), then n = 8k + 1 for some k ∈ Z+.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: