A note on Latin squares with restricted support (Q1118601)

A partial \(n\times n\) column latin square L on 1,2,...,n is an \(n\times n\) array with the property that each cell contains at most one number and each number occurs at most once in each column. L is a Latin square if each number occurs once in each row and column. Let \(n=2^ k\) and let L be a partial \(n\times n\) column Latin square with empty last column. The author proves that there exists an \(n\times n\) Latin square on the same numbers which differs from L in each cell. This is related to the Dinitz problem referred to in the previous review.