Cycle switches in Latin squares

DOI10.1007/s00373-004-0567-7zbMath1053.05020OpenAlexW2086303573MaRDI QIDQ704846

Ian M. Wanless

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0567-7

zbMATH Keywords

Latin squaresswitching cycles

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

Hownotto prove the Alon-Tarsi conjecture ⋮ Generating Uniformly Distributed Random 2-Designs with Block Size 3 ⋮ Switching for 2-designs ⋮ Autoparatopisms of Quasigroups and Latin Squares ⋮ Hamilton transversals in random Latin squares ⋮ Switching in one-factorisations of complete graphs ⋮ Parity of sets of mutually orthogonal Latin squares ⋮ Mutually orthogonal Sudoku Latin squares and their graphs ⋮ Enumeration of Latin squares with conjugate symmetry ⋮ On triple systems and strongly regular graphs ⋮ THERE ARE ASYMPTOTICALLY THE SAME NUMBER OF LATIN SQUARES OF EACH PARITY ⋮ Diagonally cyclic Latin squares. ⋮ Switching codes and designs ⋮ The cycle switching graph of the Steiner triple systems of order 19 is connected ⋮ The theory and application of latin bitrades: A survey ⋮ Parity of transversals of Latin squares ⋮ Minimal homogeneous Latin trades ⋮ The cycle structure of two rows in a random Latin square ⋮ Latin bitrades derived from groups ⋮ Permanents and Determinants of Latin Squares ⋮ Latin Squares with a Unique Intercalate ⋮ Near-automorphisms of Latin squares ⋮ A quantitative approach to perfect one-factorizations of complete bipartite graphs