1 problem

Let $G_1,\ldots,G_r$ be graphs on a common vertex set of size $n$, whose edge sets partition the edges of $K_n$, and let $\ngpl{\eta}(r;n)$ denote the minimum of…