2020/06/03 by Barros, Gabriel Ferreira, Cavalar, Bruno Pasqualotto, Mota, Guilherme Oliveira +1
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2006.02079
For graphs G and H, let G \oversetrb\longrightarrow H denote the property that for every proper edge colouring of G there is a rainbow copy of H in G. Extending a result of Nenadov, Person, Škorić and Steger [J. Combin. Theory Ser. B 124 (2017),1-38], we determine the threshold for G(n,p) \oversetrb\longrightarrow C_ℓ for cycles C_ℓ of any given length ℓ ≥ 4.