The Asymptotic Number of Latin Rectangles

DOI10.2307/2371834zbMath0060.02808OpenAlexW2319675223WikidataQ101123261 ScholiaQ101123261MaRDI QIDQ5834381

Irving Kaplansky, Paul Erdős

Publication date: 1946

Published in: American Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/74faa5c5483d21087eae6a43e01b801452097677

zbMATH Keywords

combinatorics

Mathematics Subject Classification ID

Partitions of sets (05A18) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

The number of matchings in random regular graphs and bipartite graphs, On computing the number of Latin rectangles, On the Dinitz conjecture and related conjectures, Asymptotic enumeration of generalized Latin rectangles, Asymptotics and random matrices with row-sum and column sum-restrictions, Asymptotic evaluation of the number of latin rectangles, Sequential importance sampling for estimating expectations over the space of perfect matchings, On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles, Set-Codes with Small Intersections and Small Discrepancies, Unnamed Item, On the number of Latin rectangles and chromatic polynomial of L(K//(r,s)), Quasi-Latin designs, On the combinatorial problems which I would most like to see solved, Enumerating Boolean functions of cryptographic significance, Asymptotic enumeration of Latin rectangles, Asymptotic enumeration of Latin rectangles, Systems of representatives, Combinatorial analysis. (Matrix problems, choice theory)