Guichard-Combinatorics-Graph-Theory · Problem 4.3.7

Systems of Distinct Representatives

Mathematics — Probability · latin-squares

Problem

Prove that to construct orthogonal Latin squares of order 2m2^m, m≥2m \geq 2, it suffices to find two orthogonal Latin squares of order 4=224 = 2^2 and two of order 8=238 = 2^3.

Related theory

Browse the problem library