An asymptotic version of the multigraph 1-factorization conjecture (Q4908822)
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 asymptotic version of the multigraph 1-factorization conjecture |
scientific article; zbMATH DE number 6142483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An asymptotic version of the multigraph 1-factorization conjecture |
scientific article; zbMATH DE number 6142483 |
Statements
An Asymptotic Version of the Multigraph 1‐Factorization Conjecture (English)
0 references
7 March 2013
0 references
1-factorization
0 references
1-factor
0 references
edge-coloring
0 references
multigraph
0 references
0.8905481100082397
0 references
0.8887172341346741
0 references
0.8338613510131836
0 references
0.8298570513725281
0 references
0.8259766697883606
0 references
