Pages that link to "Item:Q2628330"

The following pages link to Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems (Q2628330):

Displayed 15 items.

• Matchings in vertex-transitive bipartite graphs (Q502979) ‎ (← links)
• Covers, orientations and factors (Q785575) ‎ (← links)
• Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs (Q1618724) ‎ (← links)
• A positivity property of the dimer entropy of graphs (Q1783324) ‎ (← links)
• A generalization of permanent inequalities and applications in counting and optimization (Q2020379) ‎ (← links)
• On the number of forests and connected spanning subgraphs (Q2053728) ‎ (← links)
• Atoms of the matching measure (Q2082687) ‎ (← links)
• A short survey on stable polynomials, orientations and matchings (Q2116365) ‎ (← links)
• Upper bound for the number of spanning forests of regular graphs (Q2700981) ‎ (← links)
• Statistical Matching Theory (Q3295266) ‎ (← links)
• On the average size of independent sets in triangle-free graphs (Q4590969) ‎ (← links)
• Matchings in regular graphs‎: ‎minimizing the partition function (Q4997230) ‎ (← links)
• A Tight Analysis of Bethe Approximation for Permanent (Q5020728) ‎ (← links)
• Counting matchings via capacity-preserving operators (Q5886121) ‎ (← links)
• Tight bounds on the coefficients of partition functions via stability (Q5915725) ‎ (← links)