Home > Research > Publications & Outputs > Avoiding partial Latin squares and intricacy.
View graph of relations

Avoiding partial Latin squares and intricacy.

Research output: Contribution to Journal/MagazineJournal article

<mark>Journal publication date</mark>1/12/1997
<mark>Journal</mark>Discrete Mathematics
Issue number1-3
Number of pages16
Pages (from-to)17-32
Publication StatusPublished
<mark>Original language</mark>English


In this paper we consider the following problem: Given a partial n × n latin square P on symbols 1, 2,…, n, is it possible to find an n × n latin square L on the same symbols which differs from P in every cell? In other words, is P avoidable? We show that all 2k × 2k partial latin squares for k 2 are avoidable and give some results on odd partial latin squares. We also use these results to show that the intricacy of avoiding partial latin squares is two and of avoiding more general arrays is at most three.