Abstract
Denote by SFin(v) the set of all integer pairs (t, s) for which there exist three symmetric Latin squares of order v on the same set having fine structure (t, s). We completely determine the set SFin(2n) for any integer n ≥ 5.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams, P., Billington, E. J., Bryant, D. E., et al.: The three-way intersection problem for Latin squares. Discrete Math., 243, 1–19 (2002)
Chang, Y., Lo Faro, G., Nordo, G.: The fine structures of three Latin squares. J. Combin. Designs, 14, 85–110 (2006)
Wang, Z., Chang, Y.: Future results on fine structures of three Latin squares. Australasian J. Combin., 42, 241–252 (2008)
Curse, A. B.: On embedding incomplete symmetric Latin squares. J. Combin. Theory, Series A, 16, 18–22 (1974)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by National Natural Science Foundation of China (Grant No. 10771013)
Rights and permissions
About this article
Cite this article
Feng, E.Q., Chang, Y.X. The fine structures of three symmetric Latin squares with even orders. Acta. Math. Sin.-English Ser. 27, 1137–1148 (2011). https://doi.org/10.1007/s10114-011-8538-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-011-8538-8