Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134)
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: Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges |
scientific article |
Statements
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (English)
0 references
19 December 2014
0 references
0.8326138854026794
0 references
0.827104926109314
0 references
0.8166146278381348
0 references
0.8118027448654175
0 references
0.8097510933876038
0 references
