Bounds for Rainbow-uncommon Graphs

Blake Bates, Zhanar Berikkyzy, Nick Chiem +6

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_n)$ is asymptotically (as $n\to \infty$) greater than what…