A Note on the Asymptotic Number of Latin Rectangles

@article{Skau1998ANO,
  title={A Note on the Asymptotic Number of Latin Rectangles},
  author={Ivar Skau},
  journal={Eur. J. Comb.},
  year={1998},
  volume={19},
  pages={617-620}
}
The problem of determining an asymptotic solution for the number of Latin rectangles may be attacked by two inequalities known as Minc’s conjectureandVan der Waerden’s conjecture . We shall apply the same procedure as used in [1] on Latin squares, and we will also point out how the result given there can be improved. A k × n Latin rectangle is ak × n matrix in which each of the numbers 1 ,2, . . . ,n occurs exactly once in each row and at most once in each column. We shall denote by L(k,n) the… CONTINUE READING