Monochromatic and heterochromatic subgraph problems in a randomly colored graph

Xueliang Li, Jie Zheng

Let $K_n$ be the complete graph with $n$ vertices and $c_1,c_2,...,c_r$ be $r$ different colors. Suppose we randomly and uniformly color the edges of $K_n$ in $c_1, c_2, ..., c_…