An asymptotic independence theorem for the number of matchings in graphs

DOI10.1007/s00373-008-0832-6zbMath1211.05127OpenAlexW1983287377MaRDI QIDQ1043805

Elmar Teufl, Stephan G. Wagner

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0832-6

zbMATH Keywords

independenceasymptotic enumerationmatchingsset distance

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Enumeration of matchings in families of self-similar graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of matchings in random regular graphs and bipartite graphs
• On acyclic systems with minimal Hosoya index
• Enumeration problems for classes of self-similar graphs
• Theory of monomer-dimer systems
• A new proof of a theorem of Siegel
• On the theory of the matching polynomial

This page was built for publication: An asymptotic independence theorem for the number of matchings in graphs