Polychromatic Hamilton cycles (Q685588)
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 417458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polychromatic Hamilton cycles |
scientific article; zbMATH DE number 417458 |
Statements
Polychromatic Hamilton cycles (English)
0 references
17 October 1993
0 references
If the complete graph on \(n\) vertices is edge-colored such that the number of times that a color may occur is less than \(cn/\log(n)\), where \(c\) is a fixed constant, then there is a Hamiltonian cycle in which no two edges have the same color.
0 references
edge-colored
0 references
color
0 references
Hamiltonian cycle
0 references
0.8918347954750061
0 references
0.8917481899261475
0 references
0.8765228390693665
0 references
0.8689181208610535
0 references
