A short proof of Minc's conjecture

DOI10.1016/0097-3165(78)90036-5zbMath0391.15006OpenAlexW2039611200WikidataQ117714966 ScholiaQ117714966MaRDI QIDQ1251262

Alexander Schrijver

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/7430

zbMATH Keywords

Mincs Conjucture

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial inequalities (05A20)

Related Items (26)

Asymptotic expansions and inequalities relating to the gamma function ⋮ Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs ⋮ Inequalities for the gamma function with applications to permanents ⋮ Asymptotics of the upper matching conjecture ⋮ Entropy bounds for perfect matchings and Hamiltonian cycles ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ Concentration of the mixed discriminant of well-conditioned matrices ⋮ New permanental bounds for Ferrers matrices ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Bounding the number of cycles in a graph in terms of its degree sequence ⋮ An upper bound on the number of high-dimensional permutations ⋮ Notes on use of generalized entropies in counting ⋮ An upper bound for permanents of nonnegative matrices ⋮ The Asymmetric Travelling Salesman Problem In Sparse Digraphs. ⋮ Permanental bounds for nonnegative matrices via decomposition ⋮ The combinatorics of a three-line circulant determinant ⋮ The maximum number of Hamiltonian paths in tournaments ⋮ Computing the Partition Function for Perfect Matchings in a Hypergraph ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Extending the minc-brègman upper bound for the permanent ⋮ Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares ⋮ Bounds on the number of Eulerian orientations ⋮ An algorithmic proof of Brégman–Minc theorem ⋮ A Tight Analysis of Bethe Approximation for Permanent ⋮ A New Lower Bound for the Number of Switches in Rearrangeable Networks

Cites Work

• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof of Minc's conjecture