An asymptotic independence theorem for the number of matchings in graphs (Q1043805): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-008-0832-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-008-0832-6 / rank | |||
Normal rank | |||
Latest revision as of 14:38, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic independence theorem for the number of matchings in graphs |
scientific article |
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
