Counting Matchings and Tree-Like Walks in Regular Graphs
From MaRDI portal
Publication:3058300
DOI10.1017/S0963548309990678zbMath1207.05091MaRDI QIDQ3058300
Publication date: 19 November 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
05C30: Enumeration in graph theory
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Matchings in regular graphs: minimizing the partition function, A mysterious cluster expansion associated to the expectation value of the permanent of \(0\)-\(1\) matrices, \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy, Spectral moments of regular graphs in terms of subgraph counts
Cites Work
- Unnamed Item
- The expected eigenvalue distribution of a large regular graph
- On matching coefficients
- The Holens-Đoković conjecture on permanents fails!
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
- The matching polynomial of a regular graph
- A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\).
- Theory of monomer-dimer systems
- Matchings and walks in graphs
- Asymptotic enumeration of Latin rectangles