Latin squares with forbidden entries

Jonathan Cutler, Lars Daniel Öhinan

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

An n × n array is avoidable if there exists a Latin square which differs from the array in every cell. The main aim of this paper is to present a generalization of a result of Chetwynd and Rhodes involving avoiding arrays with multiple entries in each cell. They proved a result regarding arrays with at most two entries in each cell, and we generalize their method to obtain a similar result for arrays with arbitrarily many entries per cell. In particular, we prove that if m ∞ N there exists an N = N(m) such that if F is an N × N array with at most m entries in each cell, then F is avoidable.

Original languageEnglish
Pages (from-to)1-9
Number of pages9
JournalElectronic Journal of Combinatorics
Volume13
Issue number1 R
StatePublished - 12 May 2006

Fingerprint Dive into the research topics of 'Latin squares with forbidden entries'. Together they form a unique fingerprint.

  • Cite this