Upper bounds for permanents of \left( {0,\,1} \right)-matrices
From MaRDI portal
Publication:5725697
DOI10.1090/S0002-9904-1963-11031-9zbMATH Open0116.25202OpenAlexW1488960947WikidataQ56169492 ScholiaQ56169492MaRDI QIDQ5725697FDOQ5725697
Authors: Henryk Minc 
Publication date: 1963
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1963-11031-9
Cites Work
Cited In (50)
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- On a conjecture in the theory of permanents
- Permanental bounds for nonnegative matrices via decomposition
- The Permanent of a Transitive Relation
- Estimates of the function and quotient by Minc-Sathre
- The maximum number of Hamiltonian paths in tournaments
- New upper bounds for the number of embeddings of minimally rigid graphs
- A short proof of Minc's conjecture
- An algorithmic proof of Brégman–Minc theorem
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
- The m-Bézout bound and distance geometry
- Term ranks and permanents of nonnegative matrices
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- The combinatorics of a three-line circulant determinant
- Randomly colouring graphs (a combinatorial view)
- A general law of large permanent
- Matrices of zeros and ones with fixed row and column sum vectors
- Some Inequalities involving (r!)1/r
- A Tight Analysis of Bethe Approximation for Permanent
- A New Lower Bound for the Number of Switches in Rearrangeable Networks
- An upper bound for the permanent of \((0,1)\)-matrices.
- Results and questions on matchings in abelian groups and vector subspaces of fields
- Sequential importance sampling for estimating expectations over the space of perfect matchings
- On some inequalities involving \((n!)^{1/n}\)
- Permanents of almost regular complete bipartite graphs
- An Upper Bound for the Permanent of a Fully Indecomposable Matrix
- An upper bound for the multidimensional dimer problem
- Extending the minc-brègman upper bound for the permanent
- Sharp bounds on the permanental sum of a graph
- Systems of representatives
- Some upper bounds for permanents of (0, 1)-matrices
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
- New permanental bounds for Ferrers matrices
- New permanent approximation inequalities via identities
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
- Maximum permanents on certain classes of nonnegative matrices
- Matrix factorizations of determinants and permanents
- Asymptotic expansions and inequalities relating to the gamma function
- Generalization of a Hadamard type inequality for permanents
- Permanental bounds of the Laplacian matrix of trees with given domination number
- Notes on use of generalized entropies in counting
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
- Comparison of permanental bounds of \((0,1)\)-matrices
- Bounds on the number of Eulerian orientations
- On the number of \(r\)-matchings in a tree
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- Combinatorial analysis. (Matrix problems, choice theory)
- Maximum permanents of matrices of zeros and ones
- Concentration of the mixed discriminant of well-conditioned matrices
- Permanents of multidimensional matrices: properties and applications
This page was built for publication: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5725697)
