An asymptotic independence theorem for the number of matchings in graphs (Q1043805): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Revision as of 23:23, 29 February 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
