Rainbow Turán problems for a matching and any other graph

Dániel Gerbner, Shujing Miao

For a family of graphs $\cF$, a graph is called $\cF$-free if it does not contain any member of $\cF$ as a subgraph. Given a collection of graphs $(G_1,\dots ,G_t)$ on the same ver…