Pages that link to "Item:Q1386423"
From MaRDI portal
The following pages link to Counting 1-factors in regular bipartite graphs (Q1386423):
Displayed 17 items.
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory (Q1003594) (← links)
- On the validations of the asymptotic matching conjectures (Q1012650) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386) (← links)
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum (Q1301841) (← links)
- Several constants arising in statistical mechanics (Q1306604) (← links)
- A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\). (Q1414135) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- The combinatorics of a three-line circulant determinant (Q1766468) (← links)
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix (Q1959434) (← 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)
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy (Q3545903) (← links)