Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Anti-Ramsey threshold of cycles

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • معلومة اضافية
    • بيانات النشر:
      Elsevier BV, 2022.
    • الموضوع:
      2022
    • نبذة مختصرة :
      For graphs $G$ and $H$, let $G \overset{\mathrm{rb}}{{\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, \v{S}kori\'{c} and Steger [J. Combin. Theory Ser. B 124 (2017),1-38], we determine the threshold for $G(n,p) \overset{\mathrm{rb}}{{\longrightarrow}} C_\ell$ for cycles $C_\ell$ of any given length $\ell \geq 4$.
      Comment: 12 pages. An extended abstract of this work appeared in the proceedings of the X Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)
    • ISSN:
      0166-218X
    • Rights:
      OPEN
    • الرقم المعرف:
      edsair.doi.dedup.....87ef387a991074d99f2d2d70c6c65a4f