Rainbow planar Tur{á}n numbers of cycles

Xiaonan Liu

The rainbow Tur{á}n number of a fixed graph $H$, denoted by ${\text{ex}}^{\ast }(n,H)$, is the maximum number of edges in an $n$-vertex graph such that it admits a proper edge coloring…