Pages that link to "Item:Q1010842"
From MaRDI portal
The following pages link to On the number of matchings in regular graphs (Q1010842):
Displaying 33 items.
- Asymptotics of the upper matching conjecture (Q385029) (← links)
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134) (← links)
- Matchings in vertex-transitive bipartite graphs (Q502979) (← links)
- Counting matchings in graphs (Q579280) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- On the number of disjoint perfect matchings of regular graphs with given edge connectivity (Q729759) (← links)
- Covers, orientations and factors (Q785575) (← links)
- On the number of matchings of graphs formed by a graph operation (Q867792) (← links)
- Matchings in regular graphs from eigenvalues (Q1003830) (← links)
- Matchings and independent sets of a fixed size in regular graphs (Q1040835) (← links)
- Graphs with restricted valency and matching number (Q1043593) (← links)
- Random matchings in regular graphs (Q1280305) (← 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 proof of the upper matching conjecture for large graphs (Q1984527) (← links)
- Regular graphs with equal matching number and independence number (Q2074360) (← links)
- Regularity, matchings and Cameron-Walker graphs (Q2301245) (← links)
- A mysterious cluster expansion associated to the expectation value of the permanent of \(0\)-\(1\) matrices (Q2410018) (← links)
- \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy (Q2410494) (← links)
- Spectral moments of regular graphs in terms of subgraph counts (Q2442362) (← links)
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems (Q2628330) (← links)
- Results and questions on matchings in abelian groups and vector subspaces of fields (Q2667904) (← links)
- On matchings in graphs (Q2713637) (← links)
- Matchings in Benjamini-Schramm convergent graph sequences (Q2790620) (← links)
- Results and open problems in matchings in regular graphs (Q3166916) (← links)
- Statistical Matching Theory (Q3295266) (← links)
- (Q3655092) (← links)
- Matchings in regular graphs: minimizing the partition function (Q4997230) (← links)
- (Q5403516) (← links)
- Counting matchings via capacity-preserving operators (Q5886121) (← links)
- Tight bounds on the coefficients of partition functions via stability (Q5915725) (← links)
- Tight bounds on the coefficients of partition functions via stability (Q5970255) (← links)
- The number of perfect matchings, and the nesting properties, of random regular graphs (Q6076217) (← links)
