Key points are not available for this paper at this time.
We say a graph H is r-rainbow-uncommon if the maximum number of rainbow copies of H under an r-coloring of E (Kₙ) is asymptotically (as n) greater than what is expected from uniformly random r-colorings. Via explicit constructions, we show that for H\K₃, K₄, K₅\, H is r-rainbow-uncommon for all r |V (H) | 2. We also construct colorings to show that for t 6, Kₜ is r-rainbow-uncommon for sufficiently large r.
Bates et al. (Wed,) studied this question.