Matija Bucić, Essentially tight bounds for rainbow cycles in proper edge-colourings
An edge-coloured graph is said to be rainbow if it uses no colour more than once. Extremal problems involving rainbow objects have been a focus of much research over the …