Lower bounds for rainbow Turán numbers of paths and other trees

Daniel Johnston, Puck Rombach

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 rainbow copy of $F$, that is…