On the upper bounds of the numbers of perfect matchings in graphs with given parameters (Q871682)
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: On the upper bounds of the numbers of perfect matchings in graphs with given parameters |
scientific article; zbMATH DE number 5134787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the upper bounds of the numbers of perfect matchings in graphs with given parameters |
scientific article; zbMATH DE number 5134787 |
Statements
On the upper bounds of the numbers of perfect matchings in graphs with given parameters (English)
0 references
20 March 2007
0 references
connectivity
0 references
chromatic number
0 references
clique number
0 references
diameter
0 references
independence number
0 references
extremal graphs
0 references
0.9362094
0 references
0.9323143
0 references
0.9318789
0 references
0.93173003
0 references
0.9281715
0 references
0.9215331
0 references
0.9204461
0 references
0.9196564
0 references
