Pages that link to "Item:Q1386423"
From MaRDI portal
The following pages link to Counting 1-factors in regular bipartite graphs (Q1386423):
Displaying 38 items.
- Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs (Q322196) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Matchings in vertex-transitive bipartite graphs (Q502979) (← links)
- On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension (Q763788) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Graphs with the maximum or minimum number of 1-factors (Q965940) (← 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)
- A generalization of permanent inequalities and applications in counting and optimization (Q2020379) (← links)
- A short survey on stable polynomials, orientations and matchings (Q2116365) (← links)
- Perfect matchings in planar cubic graphs (Q2454587) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications (Q2514145) (← links)
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem (Q2568107) (← links)
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems (Q2628330) (← links)
- On the proportion of transverse-free plane curves (Q2662056) (← links)
- Matchings in Benjamini-Schramm convergent graph sequences (Q2790620) (← links)
- Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
- Permanents of multidimensional matrices: Properties and applications (Q2959191) (← links)
- Statistical Matching Theory (Q3295266) (← links)
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy (Q3545903) (← links)
- A Tight Analysis of Bethe Approximation for Permanent (Q5020728) (← links)
- Perfect Matchings of Regular Bipartite Graphs (Q5272932) (← links)
- Counting matchings via capacity-preserving operators (Q5886121) (← links)
- On the dimer problem of the vertex-edge graph of a cubic graph (Q6041554) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)
