1 paper · 1 filter
Danni Peng, Zhifei Yan
Finding near-rainbow Hamilton cycles in properly edge-coloured graphs was first studied by Andersen, who proved in 1989 that every proper edge colouring of the complete graph on $n…