On the Asymptotic Number of Latin Rectangles

TL;DR: It is proved that the number of k × n Latin rectangles is asymptotically (n!)( n(n−1)⋯ (n−k+1) n k n (1− k n ) − n 2 e − k 2 as n → ∞ with k = o(n 6 7 ) .

TL;DR: In this paper, the comportement asymptotique de L(K,n) quand n→∞ avec k borne par une bonne fonction de n

TL;DR: In this article, a lopsided version of the Lovasz Local Lemma is applied to the space of random matchings in K 2n,m,n, and tight upper bounds that asymptotically match the lower bound are shown.