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 8 items.
- A relationship between subpermanents and the arithmetic-geometric mean inequality (Q958001) (← links)
- Matchings and independent sets of a fixed size in regular graphs (Q1040835) (← links)
- An analytic approach to a permanent conjecture (Q1940312) (← 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)
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy (Q3545903) (← links)
