Maximising the permanent of $(0,1)$-matrices and the number of extensions of Latin rectangles.

Mckay, B.D., and Wanless, I.M.. "Maximising the permanent of -matrices and the number of extensions of Latin rectangles.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper R11, 20 p.-Research paper R11, 20 p.. <http://eudml.org/doc/119365>.

@article{Mckay1998,
author = {Mckay, B.D., Wanless, I.M.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {permanent; Latin rectangles; adjacency matrix; complete bipartite graph; rook polynomial},
language = {eng},
number = {1},
pages = {Research paper R11, 20 p.-Research paper R11, 20 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Maximising the permanent of -matrices and the number of extensions of Latin rectangles.},
url = {http://eudml.org/doc/119365},
volume = {5},
year = {1998},
}

TY - JOUR
AU - Mckay, B.D.
AU - Wanless, I.M.
TI - Maximising the permanent of -matrices and the number of extensions of Latin rectangles.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1998
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 5
IS - 1
SP - Research paper R11, 20 p.
EP - Research paper R11, 20 p.
LA - eng
KW - permanent; Latin rectangles; adjacency matrix; complete bipartite graph; rook polynomial
UR - http://eudml.org/doc/119365
ER -