Asymptotic enumeration of Latin rectangles

DOI10.1016/0095-8956(90)90128-MzbMath0687.05010OpenAlexW2058373352MaRDI QIDQ5906245

Chris D. Godsil, Brendan D. McKay

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90128-m

zbMATH Keywords

enumerationLatin rectangle

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (25)

The number of matchings in random regular graphs and bipartite graphs ⋮ On computing the number of Latin rectangles ⋮ Mappings of Latin squares ⋮ \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy ⋮ Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ Substructures in Latin squares ⋮ Factorisation of the complete bipartite graph into spanning semiregular factors ⋮ Sequential importance sampling for estimating expectations over the space of perfect matchings ⋮ Large deviations in random latin squares ⋮ A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\). ⋮ Exchangeable pairs, switchings, and random regular graphs ⋮ Divisors of the number of Latin rectangles ⋮ An update on Minc's survey of open problems involving permanents ⋮ Sieve methods in combinatorics ⋮ Random strongly regular graphs? ⋮ On the number of Sudoku squares ⋮ Counting Matchings and Tree-Like Walks in Regular Graphs ⋮ The cycle structure of two rows in a random Latin square ⋮ The combinatorics behind number-theoretic sieves ⋮ Most Latin squares have many subsquares ⋮ Effective scalar products of D-finite symmetric functions ⋮ On Minc's sixth Conjecture ⋮ The Holens-Đoković conjecture on permanents fails! ⋮ Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum ⋮ Permanents, matchings and Latin rectangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees in regular graphs
• The number of matchings in random regular graphs and bipartite graphs
• Asymptotic evaluation of the number of latin rectangles
• A vector space analog of permutations with restricted position
• On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
• Extrapolation of asymptotic expansions by a modified Aitken \(delta^ 2- \)formula
• The expected eigenvalue distribution of a large regular graph
• Notes on Egoritsjev's proof of the van der Waerden conjecture
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• A generalization of Riordan's formula for 3xn latin rectangles
• Hermite polynomials and a duality relation for matchings polynomials
• Theory of monomer-dimer systems
• An asymptotic series for the number of three-line latin rectangles
• Symbolic methods in the problem of three-line Latin rectangles
• The Asymptotic Series For a Certain Class Of Permutation Problems
• Combinatorial Applications of Hermite Polynomials
• On the theory of the matching polynomial
• Matchings and walks in graphs
• Derangements and Laguerre polynomials
• Counting Latin rectangles
• The Number of Very Reduced 4 × n Latin Rectangles
• The Asymptotic Number of Latin Rectangles
• Asymptotic enumeration of Latin rectangles

This page was built for publication: Asymptotic enumeration of Latin rectangles