An improved linear bound on the number of perfect matchings in cubic graphs (Q976154)
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: An improved linear bound on the number of perfect matchings in cubic graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved linear bound on the number of perfect matchings in cubic graphs |
scientific article |
Statements
An improved linear bound on the number of perfect matchings in cubic graphs (English)
0 references
17 June 2010
0 references
perfect matching polytope
0 references
0.951698124408722
0 references
0.9067758917808532
0 references
0.8995994329452515
0 references
0.8825930953025818
0 references
0.8754223585128784
0 references
