On the maximum number of Latin transversals

DOI10.1016/j.jcta.2016.02.007zbMath1334.05018arXiv1506.00983OpenAlexW2269011072MaRDI QIDQ272327

Roman Glebov, Zur Luria

Publication date: 20 April 2016

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00983

zbMATH Keywords

Latin squarestransversalsorthogonal Latin squares

Mathematics Subject Classification ID

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

Related Items (12)

Transversals, near transversals, and diagonals in iterated groups and quasigroups ⋮ Transversals, plexes, and multiplexes in iterated quasigroups ⋮ On the number of transversals in \(n\)-ary quasigroups of order 4 ⋮ On the number of transversals in a class of Latin squares ⋮ Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4 ⋮ Hamilton transversals in random Latin squares ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Additive triples of bijections, or the toroidal semiqueens problem ⋮ Enumerating extensions of mutually orthogonal Latin squares ⋮ Existence results for cyclotomic orthomorphisms ⋮ On the number of transversals in Latin squares

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound on the number of high-dimensional permutations
• The number of transversals in a Latin square
• On transversals in Latin squares
• Upper bound on the number of complete maps
• Estimation of the number of ``good permutations with applications to cryptography
• Counting designs
• Covering radius for sets of permutations
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• An upper bound on the number of Steiner triple systems
• Transversals and multicolored matchings
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Factors in random graphs
• Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares
• An entropy proof of Bregman's theorem

This page was built for publication: On the maximum number of Latin transversals