Rainbow Turán problems for paths and forests of stars

Daniel Johnston, Cory Palmer, Amites Sarkar

For a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a {\emph rainbow copy} of $F$,…