论文标题
抗拉姆西周期的阈值
Anti-Ramsey threshold of cycles
论文作者
论文摘要
对于Graphs $ G $和$ H $，令$ G \ Overset {\ Mathrm {rb}} {\ LongrightArrow}扩展了Nenadov，Person，škorić和Steger的结果[J.组合。理论ser。 b 124（2017），1-38]，我们确定$ g（n，p）\ overset {\ mathrm {rb}} {\ longrightArrow} c_ \ ell $ for Cycles $ c_ \ ell $ c_ \ ell $的阈值。
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, Škorić 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$.
