Combinatorics and Graph Theory · Problem 4.3.7

Systems of Distinct Representatives — David Guichard

Mathematics — Combinatorics · latin-squares

Problem

Prove that to construct orthogonal Latin squares of order

2^m

m \geq 2

, it suffices to find two orthogonal Latin squares of order

4 = 2^2

and two of order

8 = 2^3