An asymptotic independence theorem for the number of matchings in graphs
type: Item
instance of: scholarly article
title: An asymptotic independence theorem for the number of matchings in graphs
zbMATH Open document ID: 1211.05127
author: Elmar Teufl
author: Stephan Wagner
published in: Graphs and Combinatorics
publication date: 2009-12-09T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5644636
zbMATH Keywords: matchings
zbMATH Keywords: independence
zbMATH Keywords: set distance
zbMATH Keywords: asymptotic enumeration
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: s00373-008-0832-6
OpenAlex ID: W1983287377
cites work: Q4402005
cites work: The number of matchings in random regular graphs and bipartite graphs
cites work: A new proof of a theorem of Siegel
cites work: On the theory of the matching polynomial
cites work: Q3807048
cites work: Theory of monomer-dimer systems
cites work: On acyclic systems with minimal Hosoya index
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Enumeration problems for classes of self-similar graphs
cites work: Q4253909
DOI: 10.1007/S00373-008-0832-6
description: scientific article; zbMATH DE number 5644636