1. |
- Öhman, Lars-Daniel
(författare)
-
On the intricacy of avoiding multiple-entry arrays
- 2012
-
Ingår i: Discrete Mathematics. - : Elsevier. - 0012-365X .- 1872-681X. ; 312:20, s. 3030-3036
-
Tidskriftsartikel (refereegranskat)abstract
- Let A be any n x n array on the symbols vertical bar n vertical bar = {1, . . . , n}, with at most in symbols in each cell. An n x n Latin square L on the symbols till is said to avoid A if no entry in L is present in the corresponding cell of A, and A is said to be avoidable if such a Latin square L exists. The intricacy of this problem is defined to be the minimum number of arrays into which A must be split in order to ensure that each part is avoidable. We present lower and upper bounds for the intricacy, and conjecture that the lower bound is in fact the correct answer. (C) 2012 Elsevier B.V. All rights reserved.
|
|