Proof that a collection C of t mutually orthogonal latin squares of side n can be completed in at most one nontrivial way if<>. The author shows that C can always be completed if<>. He also proves a number of other theorems giving sufficient condit...
