Name
Abstract | ||
|---|---|---|
Let N(n) denote the maximum number of mutually orthogonal Latin squares of order n. It is shown that for large n, N(n)=n117-2 In addition to a known number-theoretic result, the proof uses a new combinatorial construction which also allows a quick derivation of the existence of a pair of orthogonal squares of all orders n 14. In addition, it is proven that N(n) = 6 whenever n 90. |
Year | DOI | Venue |
|---|---|---|
1974 | 10.1016/0012-365X(74)90148-4 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Orthogonal array,Combinatorics,Graeco-Latin square,Mathematics | Journal | 9 |
Issue | ISSN | Citations |
2 | Discrete Mathematics | 35 |
PageRank | References | Authors |
39.42 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard M. Wilson | 1 | 697 | 340.86 |