Add to ORKGAbstract. Let A be any n × n array on the symbols [n], with at most m symbols in each cell. An n × n Latin square L avoids A if no entry in L is present in the corresponding cell in A. If m = 1 and A is split into two arrays B and C in a special way, there are Latin squares L B and L C avoiding B and C respectively. In other words, the intricacy of avoiding arrays is 2, the number of arrays into which A has to be split. We also investigate the case m > 1, derive some upper and lower bounds, and propose a conjecture on the exact value of the intricacy for the general case
Let P be an n x n array of symbols. P is called avoidable if for every set of n symbols, there is an...
An $n \times n$ array is \emph{avoidable} if for each set of $n$ symbols there is a Latin square on ...
AbstractWe show that for any positive integer k⩾4, if R is a (2k-1)×(2k-1) partial Latin square, the...
AbstractLet A be any n×n array on the symbols [n]={1,…,n}, with at most m symbols in each cell. An n...
AbstractLet A be any n×n array on the symbols [n], with at most one symbol in each cell. An n×n Lati...
This thesis consists of the four papers listed below and a survey of the research area. I Lina J. An...
This thesis consists of the four papers listed below and a survey of the research area. I Lina J. An...
This thesis consists of the four papers listed below and a survey of the research area. I Lina J. An...
AbstractAn n×n array A with entries from {1,…,n} is avoidable if there is an n×n Latin square L such...
An n × n array is avoidable if there exists a Latin square which differs from the array in every cel...
An $n \times n$ array is \emph{avoidable} if for each set of $n$ symbols there is a Latin square on ...
In this paper we consider the following problem: Given a partial n × n latin square P on symbols 1, ...
AbstractAn n×n array A with entries from {1,…,n} is avoidable if there is an n×n Latin square L such...
AbstractIn this paper we consider the following problem: Given a partial n × n latin square P on sym...
In this paper we consider the problem of avoiding arrays with more than one entry per cell. An n × n...
Let P be an n x n array of symbols. P is called avoidable if for every set of n symbols, there is an...
An $n \times n$ array is \emph{avoidable} if for each set of $n$ symbols there is a Latin square on ...
AbstractWe show that for any positive integer k⩾4, if R is a (2k-1)×(2k-1) partial Latin square, the...
AbstractLet A be any n×n array on the symbols [n]={1,…,n}, with at most m symbols in each cell. An n...
AbstractLet A be any n×n array on the symbols [n], with at most one symbol in each cell. An n×n Lati...
This thesis consists of the four papers listed below and a survey of the research area. I Lina J. An...
This thesis consists of the four papers listed below and a survey of the research area. I Lina J. An...
This thesis consists of the four papers listed below and a survey of the research area. I Lina J. An...
AbstractAn n×n array A with entries from {1,…,n} is avoidable if there is an n×n Latin square L such...
An n × n array is avoidable if there exists a Latin square which differs from the array in every cel...
An $n \times n$ array is \emph{avoidable} if for each set of $n$ symbols there is a Latin square on ...
In this paper we consider the following problem: Given a partial n × n latin square P on symbols 1, ...
AbstractAn n×n array A with entries from {1,…,n} is avoidable if there is an n×n Latin square L such...
AbstractIn this paper we consider the following problem: Given a partial n × n latin square P on sym...
In this paper we consider the problem of avoiding arrays with more than one entry per cell. An n × n...
Let P be an n x n array of symbols. P is called avoidable if for every set of n symbols, there is an...
An $n \times n$ array is \emph{avoidable} if for each set of $n$ symbols there is a Latin square on ...
AbstractWe show that for any positive integer k⩾4, if R is a (2k-1)×(2k-1) partial Latin square, the...