1 paper
Xinmin Hou, Daoguang Xiong
An edge-colored graph is called rainbow if all its edges have distinct colors. For a fixed graph H, the rainbow Turán number $\exstar(n, H)$ is the maximum number of edges in a p…