Multicolor $K_r$-Tilings with High Discrepancy

Abstract

We study the minimum degree threshold $\delta_{r,q}$ guaranteeing the existence of $K_r$-tilings of high discrepancy in any $q$-edge-coloring. Balogh, Csaba, Pluh\'ar and Treglown handled the 2-color case, proving that $\delta_{r,2} = \frac{r}{r+1}$ for all $r \geq 3$. Here we determine $\delta_{r,q}$ for all $q$ large enough, namely $q \geq \binom{r}{2}$. For example, we show that for $r \geq 4$, $\delta_{r,q} = \frac{r}{r+1}$ for $\binom{r}{2} \leq q \leq \binom{r+1}{2}$ and $\delta_{r,q} = \frac{r-1}{r}$ for $q \geq \binom{r+1}{2}+2$. Thus, $\delta_{r,q}$ has a phase transition at $q = \binom{r+1}{2}$, where it drops from $\frac{r}{r+1}$ and then stabilizes at the existence threshold $\frac{r-1}{r}$. We also show that $\delta_{r,q} \leq \frac{r}{r+1}$ for all $r,q$, supplementing and giving a new proof for the result of Balogh, Csaba, Pluh\'ar and Treglown.