Skip to main content
Log in

Addendum To Schrijver's Work On Minimum Permanents

  • NOTE
  • Published:
Combinatorica Aims and scope Submit manuscript

Let \( \Lambda ^{k}_{n} \) denote the set of n×n binary matrices which have each row and column sum equal to k. For 2≤kn→∞ 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ian M. Wanless*.

Additional information

* Written while the author was employed by the Department of Computer Science at the Australian National University.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-006-0040-z

Mathematics Subject Classification (2000):

Navigation