Polychromatic Hamilton cycles (Q685588)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polychromatic Hamilton cycles
scientific article

    Statements

    Polychromatic Hamilton cycles (English)
    0 references
    0 references
    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

    Identifiers