A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case (Q801134)

[For part I see ibid. 61, 187-198 (1984; reviewed above)]. Let A be a fully indecomposable \(n\times n\) matrix with integer entries and row and column sums \(r_ i\) and \(c_ i\), respectively. Matrices A are characterized for which per A\(=1+\min [\prod_{i}(r_ i- 1),\prod_{i}(c_ i-1)]\) holds.