Color degree condition for long rainbow paths in edge-colored graphs (Q5964923)

Let \(c\) be an edge coloring (not necessarily proper) of a graph \(G=(V,E)\) and define the color degree \(d^c(v)\) of a vertex \(v \in V\) to be the number of different colors that are used by \(c\) on edges incident to \(v\). A rainbow path of \(G\) with respect to \(c\) is a path such that any pair of edges of the path have different colors. In this paper, the authors prove the following result which improves a previous one: If \(d^c(v) \geq k \geq 7\) for each vertex \(v \in V\), then \(G\) has a rainbow path of length at least \(\lceil 2k/3\rceil +1\).