Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (Q1926046)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6118558
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) |
scientific article; zbMATH DE number 6118558 |
Statements
Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (English)
0 references
27 December 2012
0 references
2-edge-coloring
0 references
monochromatic subgraph
0 references
1-factor
0 references
0.8792308568954468
0 references
0.8608153462409973
0 references
0.8043767809867859
0 references
0.8033100962638855
0 references
0.7907360792160034
0 references
