A note on Latin squares with restricted support
type: Item
instance of: scholarly article
title: A note on Latin squares with restricted support
zbMATH Open document ID: 0669.05015
DOI: 10.1016/0012-365X(89)90092-7
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: 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.
reviewed by: Gary L. Mullen
Mathematics Subject Classification ID: 05B15
zbMATH DE Number: 4095475
zbMATH Keywords: latin square
zbMATH Keywords: Dinitz problem
author: Roland Häggkvist
MaRDI profile type: Publication
cites work: List-colourings of graphs
cites work: Towards a solution of the Dinitz problem?
full work available at URL: 0012-365x(89)90092-7
OpenAlex ID: W2095981597
description: scientific article; zbMATH DE number 4095475