Pages that link to "Item:Q3058300"
From MaRDI portal
The following pages link to Counting Matchings and Tree-Like Walks in Regular Graphs (Q3058300):
Displaying 4 items.
- 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)
- Matchings in regular graphs: minimizing the partition function (Q4997230) (← links)
