An asymptotic independence theorem for the number of matchings in graphs (Q1043805): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-008-0832-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983287377 / rank | |||
Normal rank | |||
Revision as of 21:07, 19 March 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
