Pages that link to "Item:Q1251262"
From MaRDI portal
The following pages link to A short proof of Minc's conjecture (Q1251262):
Displaying 26 items.
- Asymptotics of the upper matching conjecture (Q385029) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- An upper bound on the number of high-dimensional permutations (Q485003) (← links)
- Notes on use of generalized entropies in counting (Q503654) (← links)
- Entropy bounds for perfect matchings and Hamiltonian cycles (Q624182) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- Bounds on the number of Eulerian orientations (Q787162) (← links)
- Concentration of the mixed discriminant of well-conditioned matrices (Q905709) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- Permanental bounds for nonnegative matrices via decomposition (Q1765888) (← links)
- The combinatorics of a three-line circulant determinant (Q1766468) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs (Q1906843) (← links)
- Inequalities for the gamma function with applications to permanents (Q1918538) (← links)
- Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
- The maximum number of Hamiltonian paths in tournaments (Q2276976) (← links)
- An upper bound for permanents of nonnegative matrices (Q2474496) (← links)
- Permanents of multidimensional matrices: Properties and applications (Q2959191) (← links)
- Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630) (← links)
- A New Lower Bound for the Number of Switches in Rearrangeable Networks (Q3960605) (← links)
- Extending the minc-brègman upper bound for the permanent (Q4485089) (← links)
- A Tight Analysis of Bethe Approximation for Permanent (Q5020728) (← links)
- Asymptotic expansions and inequalities relating to the gamma function (Q5054092) (← links)
- Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares (Q5501087) (← links)
- An algorithmic proof of Brégman–Minc theorem (Q5850764) (← links)
- The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
