Maximum packings in graphs forbidding given rainbow cycles

Ping Li, Yang Yang

For graphs $F$ and $G$, $F$-multicolor Turán number of $G$, denoted by ${\mathrm{ex}}_F(n,G)$, is the maximum number of edge-disjoint copies of $F$ in an $n$-vertex graph such that…