Loading...

The three-way intersection problem for latin squares

Adams, P ; Sharif University of Technology | 2002

37 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/S0012-365X(00)00454-4
  3. Publisher: 2002
  4. Abstract:
  5. The set of integers k for which there exist three latin squares of order n having precisely k cells identical, with their remaining n2 -k cells different in all three latin squares, denoted by I3[n], is determined here for all orders n. In particular, it is shown that I3[n] = {0,.,n2 -15}U [n2 - 12,n2-9,n2], for n ≫8. ©2002 Eisevier Science B.V. All rights reserved
  6. Keywords:
  7. Source: Discrete Mathematics ; Volume 243, Issue 1-3 , 2002 , Pages 1-19 ; 0012365X (ISSN)
  8. URL: https://www.sciencedirect.com/science/article/pii/S0012365X00004544