Counting rainbow triangles in edge‐colored graphs
Counting rainbow triangles in edge‐colored graphs
Abstract Let be an edge‐colored graph on vertices. The minimum color degree of , denoted by , is defined as the minimum number of colors assigned to the edges incident to a vertex in . In 2013, Li proved that an edge‐colored graph on vertices contains a rainbow triangle if …