Counting 1-factors in regular bipartite graphs
From MaRDI portal
Publication:1386423
DOI10.1006/jctb.1997.1798zbMath0905.05060OpenAlexW1999344551MaRDI QIDQ1386423
Publication date: 20 December 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/2154
Related Items
Counting matchings via capacity-preserving operators, Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems, Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs, Graph factors and factorization: 1985--2003: a survey, On the proportion of transverse-free plane curves, On the dimer problem of the vertex-edge graph of a cubic graph, Perfect matching in bipartite hypergraphs subject to a demand graph, Permanents of multidimensional matrices: Properties and applications, A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\)., Problems and results in extremal combinatorics. I., A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix, Randomly colouring graphs (a combinatorial view), Statistical Matching Theory, Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy, Perfect matchings in planar cubic graphs, Matchings in vertex-transitive bipartite graphs, On the numbers of 1-factors and 1-factorizations of hypergraphs, An update on Minc's survey of open problems involving permanents, The combinatorics of a three-line circulant determinant, An improved linear bound on the number of perfect matchings in cubic graphs, Exponentially many perfect matchings in cubic graphs, A generalization of permanent inequalities and applications in counting and optimization, Spanning trees of 3-uniform hypergraphs, Matchings in Benjamini–Schramm convergent graph sequences, Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications, Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory, On the validations of the asymptotic matching conjectures, A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor, Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension, Approximating the permanent via importance sampling with application to the dimer covering problem, Theory of computation of multidimensional entropy with an application to the monomer-dimer problem, Cubic bridgeless graphs have more than a linear number of perfect matchings, Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum, Several constants arising in statistical mechanics, A Tight Analysis of Bethe Approximation for Permanent, A short survey on stable polynomials, orientations and matchings, Perfect Matchings of Regular Bipartite Graphs
Cites Work
- Matching theory
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- On the number of edge-colourings of regular bipartite graphs
- A lower bound for the permanent of a doubly stochastic matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
