Let \( \Lambda ^{k}_{n} \) denote the set of n×n binary matrices which have each row and column sum equal to k. For 2≤k≤n→∞ we show that \( {\left( {\min _{{A \in \Lambda ^{k}_{n} }} {\text{per}}{\kern 1pt} A} \right)}^{{1/n}} \) is asymptotically equal to (k−1)k−1k2−k. This confirms Conjecture 23 in Minc's catalogue of open problems.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
* Written while the author was employed by the Department of Computer Science at the Australian National University.
Rights and permissions
About this article
Cite this article
Wanless*, I.M. Addendum To Schrijver's Work On Minimum Permanents. Combinatorica 26, 743–745 (2006). https://doi.org/10.1007/s00493-006-0040-z
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s00493-006-0040-z