The Asymptotic Number of Latin Rectangles
From MaRDI portal
Recommendations
Cited in
(27)- Estimating the number of Latin rectangles by the fast simulation method
- The number of matchings in random regular graphs and bipartite graphs
- Asymptotic enumeration of generalized Latin rectangles
- Asymptotic evaluation of the number of latin rectangles
- On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
- On the combinatorial problems which I would most like to see solved
- A note on the asymptotic number of Latin rectangles
- Combinatorial analysis. (Matrix problems, choice theory)
- On the Dinitz conjecture and related conjectures
- Quasi-Latin designs
- The number of slim rectangular lattices.
- Asymptotics for numbers of line segments and lines in a square grid
- On computing the number of Latin rectangles
- How many Latin rectangles are there?
- scientific article; zbMATH DE number 3989359 (Why is no real title available?)
- On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
- Counting Latin rectangles
- Depth two majority circuits for majority and list expanders
- Set-codes with small intersections and small discrepancies
- Asymptotics and random matrices with row-sum and column sum-restrictions
- scientific article; zbMATH DE number 961244 (Why is no real title available?)
- Congruences Connected with Three-Line Latin Rectangles
- Asymptotic enumeration of Latin rectangles
- Asymptotic enumeration of Latin rectangles
- Systems of representatives
- Sequential importance sampling for estimating expectations over the space of perfect matchings
- Enumerating Boolean functions of cryptographic significance
This page was built for publication: The Asymptotic Number of Latin Rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5834381)