Generalized Rainbow Turán Numbers
Generalized Rainbow Turán Numbers
Alon and Shikhelman [J. Comb. Theory, B. 121 (2016)] initiated the systematic study of the following generalized Turán problem: for fixed graphs H and F and an integer n, what is the maximum number of copies of H in an n-vertex F-free graph?
 An edge-colored graph is called rainbow if …