In any proper edge-colouring of a graph with n vertices and minimum degree at least (1/2+ε)n, if every colour appears on at most n/8 edges, there is a Hamilton cycle using n−o(n) distinct colours.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Near rainbow Hamilton cycles in dense graphs
In any proper edge-colouring of a graph with n vertices and minimum degree at least (1/2+ε)n, if every colour appears on at most n/8 edges, there is a Hamilton cycle using n−o(n) distinct colours.