On Lower Bounds for Permanents of (0, 1) Matrices

DOI10.2307/2036935zbMath0192.36801OpenAlexW4231502906MaRDI QIDQ5587163

Henryk Minc

Publication date: 1969

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2036935

zbMATH Keywords

linear algebra, forms

Related Items (10)

(0,1)-matrices with minimal permanents ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ New permanental bounds for Ferrers matrices ⋮ Conversion of the Permanent into the Determinant ⋮ Randomly colouring graphs (a combinatorial view) ⋮ On Constructing Nearly Decomposable Matrices ⋮ An improved linear bound on the number of perfect matchings in cubic graphs ⋮ Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function ⋮ Nearly decomposable matrices ⋮ Combinatorial analysis. (Matrix problems, choice theory)

This page was built for publication: On Lower Bounds for Permanents of (0, 1) Matrices