The cycle structure of two rows in a random Latin square
From MaRDI portal
Publication:3608297
DOI10.1002/rsa.20216zbMath1202.05015MaRDI QIDQ3608297
Ian M. Wanless, Nicholas J. Cavenagh, Catherine Greenhill
Publication date: 4 March 2009
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20216
05B15: Orthogonal arrays, Latin squares, Room squares
Related Items
Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting, Computing the autotopy group of a Latin square by cycle structure, Switching codes and designs, On the number of transversals in Cayley tables of cyclic groups, A cube dismantling problem related to bootstrap percolation, Bounds on the number of small Latin subsquares, Bounds on the number of autotopisms and subsquares of a Latin square, Hownotto prove the Alon-Tarsi conjecture, THERE ARE ASYMPTOTICALLY THE SAME NUMBER OF LATIN SQUARES OF EACH PARITY, Near-automorphisms of Latin squares, The theory and application of latin bitrades: A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gaussian limiting distributions for the number of components in combinatorial structures
- Cycle switches in Latin squares
- Most Latin squares have many subsquares
- All-even Latin squares
- On the number of Latin squares
- Asymptotics of generating the symmetric and alternating groups.
- Small latin squares, quasigroups, and loops
- On Random Generation of the Symmetric Group
- Asymptotic enumeration of Latin rectangles