More on Rainbow Cliques in Edge-Colored Graphs

Xiao-Chuan Liu, Danni Peng, Xu Yang

In an edge-colored graph $G$, a rainbow clique $K_k$ is a $k$-complete subgraph in which all the edges have distinct colors. Let $e(G)$ and $c(G)$ be the number of edges and colors…