Asymptotic enumeration of Latin rectangles
HTML articles powered by AMS MathViewer
- by C. D. Godsil and B. D. McKay PDF
- Bull. Amer. Math. Soc. 10 (1984), 91-92
References
- Paul Erdös and Irving Kaplansky, The asymptotic number of Latin rectangles, Amer. J. Math. 68 (1946), 230–236. MR 15356, DOI 10.2307/2371834
- C. D. Godsil, Matchings and walks in graphs, J. Graph Theory 5 (1981), no. 3, 285–297. MR 625070, DOI 10.1002/jgt.3190050310
- C. D. Godsil, Hermite polynomials and a duality relation for matching polynomials, Combinatorica 1 (1981), no. 3, 257–262. MR 637830, DOI 10.1007/BF02579331
- Ole J. Heilmann and Elliott H. Lieb, Theory of monomer-dimer systems, Comm. Math. Phys. 25 (1972), 190–232. MR 297280, DOI 10.1007/BF01877590
- S. A. Joni and G.-C. Rota, A vector space analog of permutations with restricted position, J. Combin. Theory Ser. A 29 (1980), no. 1, 59–73. MR 577543, DOI 10.1016/0097-3165(80)90047-3
- Brendan D. McKay, The expected eigenvalue distribution of a large regular graph, Linear Algebra Appl. 40 (1981), 203–216. MR 629617, DOI 10.1016/0024-3795(81)90150-6
- Charles M. Stein, Asymptotic evaluation of the number of Latin rectangles, J. Combin. Theory Ser. A 25 (1978), no. 1, 38–49. MR 499035, DOI 10.1016/0097-3165(78)90029-8
- Koichi Yamamoto, On the asymptotic number of Latin rectangles, Jpn. J. Math. 21 (1951), 113–119 (1952). MR 51203, DOI 10.4099/jjm1924.21.0_{1}13
Additional Information
- Journal: Bull. Amer. Math. Soc. 10 (1984), 91-92
- MSC (1980): Primary 05A15, 05B20
- DOI: https://doi.org/10.1090/S0273-0979-1984-15196-6
- MathSciNet review: 722858