Rainbow Turán numbers for paths of length four

Sylwia Antoniuk, Andrzej Grzesik, Magdalena Prorok +1

Given a set $V$ of $n$ vertices and an integer $k\ge 1$, our goal is to maximize the number of edges in graphs $G_1,G_2,\dots ,G_k$, defined on $V$, under the constraint that the…