The minimum color degree and a large rainbow cycle in an edge-colored graph

Wipawee Tangjai

Let $G$ be an edge-colored graph with $n$ vertices. A subgraph $H$ of $G$ is called a rainbow subgraph of $G$ if the colors of each pair of the edges in $E(H)$ are distinct. We def…