Abstract
For graphs G and H, let G⟶rbH 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 et al. (2017), we determine the threshold for G(n,p)⟶rbCℓ for cycles Cℓ of any given length ℓ≥4.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
