Name
Abstract | ||
|---|---|---|
A partial latin square P of order n is an n x n array with entries from the set {1, 2,..., n} such that each symbol is used at most once in each row and at most once in each column. If every cell of the array is filled we call P a latin square. A partial latin square P of order n is said to be avoidable if there exists a latin square L of order n such that P and L are disjoint. That is, corresponding cells of P and L contain different entries. In this note we show that, with the trivial exception of the latin square of order 1, every partial latin square of order congruent to 1 modulo 4 is avoidable. |
Year | Venue | Field |
|---|---|---|
2010 | ARS COMBINATORIA | Discrete mathematics,Latin square,Mathematics |
DocType | Volume | ISSN |
Journal | 95 | 0381-7032 |
Citations | PageRank | References |
7 | 0.80 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas J. Cavenagh | 1 | 92 | 20.89 |