Exact and asymptotic enumeration of perfect matchings in self-similar graphs (Q1045201)
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: Exact and asymptotic enumeration of perfect matchings in self-similar graphs |
scientific article; zbMATH DE number 5648221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and asymptotic enumeration of perfect matchings in self-similar graphs |
scientific article; zbMATH DE number 5648221 |
Statements
Exact and asymptotic enumeration of perfect matchings in self-similar graphs (English)
0 references
15 December 2009
0 references
perfect matchings
0 references
self-similar graphs
0 references
exact enumeration
0 references
asymptotics
0 references
0.8465384244918823
0 references
0.8360838294029236
0 references
0.7813767790794373
0 references
0.7695053815841675
0 references
