Latin squares;
clique partition number;
intersection number;
D O I:
10.1515/dma-2021-0002
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
Two Latin squares A, B of order n are called pseudo orthogonal if for any 1 <= i, j <= n there exists a k, 1 <= k <= n, such that A(i, k) = B(j, k). We prove that the existence of a family of m mutually pseudo orthogonal Latin squares of order n is equivalent to the existence of a family of m mutually orthogonal Latin squares of order n. We also obtain exact values of clique partition numbers of several classes of complete multipartite graphs and of the tensor product of complete graphs.