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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
