𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic evaluation of the number of Latin rectangles

✍ Scribed by Charles M Stein

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
440 KB
Volume
25
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Note on the Asymptotic Number of Latin
A Note on the Asymptotic Number of Latin Rectangles
✍ I. Skau πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 75 KB

The enumeration problem of Latin rectangles is formulated in terms of permanents, and two 'hard' inequalities of permanents are applied in a squeezing manner, both giving and suggesting asymptotic formulas.

A Matroid Generalization of a Result on
A Matroid Generalization of a Result on Row-Latin Rectangles
✍ Glenn G. Chappell πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 194 KB

Let A be an m\_n matrix in which the entries of each row are all distinct. A. A. Drisko (1998, J. Combin. Theory Ser. A 84, 181 195) showed that if m 2n&1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices with entries in the

Defining sets in vertex colorings of gra
Defining sets in vertex colorings of graphs and latin rectangles
✍ E.S. Mahmoodian; Reza Naserasr; Manouchehr Zaker πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 410 KB

In a given graph G, a set of vertices S with an assignment of colors is said to be a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a z(G)coloring of the vertices of G. The concept of a defining set has been studied, to some extent, for block desig