Rainbow Turán numbers for short brooms

John Byrne, E. G. K. M Gamlath, Anastasia Halfpap +2

A graph $G$ is rainbow-$F$-free if it admits a proper edge-coloring without a rainbow copy of $F$. The rainbow Turán number of $F$, denoted $\mathrm{e}{\mathrm{x}}^{\ast }(n,F)$, is the maximum num…