Home > Research > Publications & Outputs > Avoiding multiple entry arrays.
View graph of relations

Avoiding multiple entry arrays.

Research output: Contribution to Journal/MagazineJournal article

Published
<mark>Journal publication date</mark>08/1997
<mark>Journal</mark>Journal of Graph Theory
Issue number4
Volume25
Number of pages10
Pages (from-to)257-266
Publication StatusPublished
<mark>Original language</mark>English

Abstract

In this paper we consider the problem of avoiding arrays with more than one entry per cell. An n × n array on n symbols is said to be if an n × n latin square, on the same symbols, can be found which differs from the array in every cell. Our first result is for chessboard squares with at most two entries per black cell. We show that if k 1 and C is a 4k × 4k chessboard square on symbols 1, 2, , 4k in which every black cell contains at most two symbols and every symbol appears at most once in every row and column, then C is avoidable. Our main result is for squares with at most two entries in any cell and answers a question of Hilton. If k 3240 and F is a 4k × 4k array on 1, 2,, 4k in which every cell contains at most two symbols and every symbol appears at most twice in every row and column, then F is avoidable