Tiling edge-coloured graphs with few monochromatic bounded-degree graphs

Jan Corsten, Walner Mendonça

We prove that for all integers $\Delta ,r\ge 2$, there is a constant $C=C(\Delta ,r)>0$ such that the following is true for every sequence $\mathcal{F}=\{F_1,F_2,\dots \}$ of graphs w…