On the number of Latin squares

Annals of Combinatorics

Volumn 9, Issue 3, 2005, Pages 335-344

  McKay, Brendan D ^a   Wanless, Ian M ^a,b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b CHARLES DARWIN UNIVERSITY   (Australia)

Author keywords

1 factorisation; Enumeration; Latin square; Permanent; Regular bipartite graph

Indexed keywords

EID: 26044433646     PISSN: 02180006     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00026-005-0261-7     Document Type: Article

References (21)

1. R. Alter, How many Latin squares are there? Amer. Math. Monthly 82 (1975) 632-634.
2. S.E. Bammel and J. Rothstein, The number of 9 × 9 Latin squares, Discrete Math. 11 (1975) 93-95.
3. J.W. Brown, Enumeration of Latin squares with application to order 8, J. Combin. Theory 5 (1968) 177-184.
4. A. Cayley, On Latin squares, Oxf. Camb. Dublin Messenger Math. 19 (1890) 135-137.
5. L. Euler, Recherches sur une nouvelle espèce de quarrés magiques, Verh. Zeeuwsch Gennot. Weten Vliss 9 (1782) 85-239.
6. M. Frolov, Sur les permutations carrés, J. de Math. spéc. IV (1890) 8-11, 25-30.
7. C.D. Godsil and B.D. McKay, Asymptotic enumeration of Latin rectangles, J. Combin. Theory Ser. B 48 (1990) 19-44.
8. P.A. MacMahon, Combinatory Analysis, Cambridge, 1915.
9. G.L. Mullen, How many i-j reduced Latin squares are there? Amer. Math. Monthly 85 (1978) 751-752.
10. B.D. McKay, Nauty graph isomorphic software, available at: http://cs.anu.edu.au/~bdm/nauty.
11. B.D. McKay, A. Meynert, and W. Myrvold, Small Latin squares, quasigroups and loops, submitted.
12. B.D. McKay and E. Rogoyski, Latin squares of order 10, Electron. J. Combin. 2 (1995) #N3 4 pp.
13. B.D. McKay and I.M. Wanless, Maximising the permanent of (0. 1)-matrices and the number of extensions of Latin rectangles, Electron. J. Combin. 5 (1998) #R11 20 pp.
14. H.W. Norton, The 7 × 7 squares, Ann. Eugenics 9 (1939) 269-307.
15. éme ordre. Conjectures pour les ordres supérieurs, privately published, Marseille, 1948, 8 pp.
16. P.M. Saxena, A simplified method of enumerating Latin squares by MacMahon's differential operators; II. The 7 × 7 Latin squares, J. Indian Soc. Agricultural Statist. 3 ( 1951) 24-79.
17. J.Y. Shao and W.D. Wei, A formula for the number of Latin squares, Discrete Math. 110 (1992) 293-296.
18. G. Tarry, Le problème des 36 officiers, Ass. Franc. Paris 29 (1900) 170-203.
19. J.H. van Lint and R.M. Wilson, A Course in Combinatorics, Cambridge University Press, 1992.
20. M.B. Wells, The number of Latin squares of order eight, J. Combin. Theory 3 (1967) 98-99.
21. M.B. Wells, Elements of Combinatorial Computing, Pergamon Press, Oxford-New York-Toronto, 1971.