Pages that link to "Item:Q1414135"
From MaRDI portal
The following pages link to A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\). (Q1414135):
Displaying 20 items.
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case (Q801134) (← links)
- Addendum to Schrijver's work on minimum permanents (Q879172) (← links)
- Maximum permanents on certain classes of nonnegative matrices (Q913888) (← links)
- A relationship between subpermanents and the arithmetic-geometric mean inequality (Q958001) (← links)
- On Kramer-Mesner matrix partitioning conjecture (Q973157) (← links)
- Matchings and independent sets of a fixed size in regular graphs (Q1040835) (← links)
- A note on a conjecture on permanents (Q1073874) (← links)
- Maximum permanents of matrices of zeros and ones (Q1104376) (← links)
- On a combinatorial problem related to permanents (Q1109771) (← links)
- A comparison theorem for permanents and a proof of a conjecture on \((t,m)\)-families (Q1194752) (← links)
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum (Q1301841) (← links)
- Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles (Q1379135) (← links)
- An analytic approach to a permanent conjecture (Q1940312) (← links)
- Geršgorin variations. III: On a theme of Brualdi and Varga (Q2463607) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem (Q2568107) (← links)
- Counting Matchings and Tree-Like Walks in Regular Graphs (Q3058300) (← links)
- On Minc's sixth Conjecture (Q3422759) (← links)
- (Q3487560) (← links)
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy (Q3545903) (← links)
