On sufficient conditions for rainbow cycles in edge-colored graphs

Shinya Fujita, Bo Ning, Chuandong Xu +1

Let $G$ be an edge-colored graph. We use $e(G)$ and $c(G)$ to denote the number of edges of $G$ and the number of colors appearing on $E(G)$, respectively. For a vertex $v\in V(G)$…