An asymptotic independence theorem for the number of matchings in graphs (Q1043805)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An asymptotic independence theorem for the number of matchings in graphs |
scientific article; zbMATH DE number 5644636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic independence theorem for the number of matchings in graphs |
scientific article; zbMATH DE number 5644636 |
Statements
An asymptotic independence theorem for the number of matchings in graphs (English)
0 references
9 December 2009
0 references
matchings
0 references
independence
0 references
set distance
0 references
asymptotic enumeration
0 references
