Some rainbow cycles in r-good edge-colorings

作者：

Highlights：

•

摘要

Let Gϕ be an edge-colored graph with order n and δGϕ be the smallest number of distinctly colored edges incident to a vertex of Gϕ. To determine the smallest function h(n) such that any edge-colored graph Gϕ of order n contains a rainbow cycle if δGϕ≥h(n)? It is known that log2n

论文关键词：Rainbow cycles,Color degree,r-good edge-coloring,Extremal problems

论文评审过程：Received 7 November 2018, Revised 27 June 2019, Accepted 1 July 2019, Available online 15 July 2019, Version of Record 15 July 2019.

论文官网地址：https://doi.org/10.1016/j.amc.2019.124566