The exact generalized Turán number for \(C_6\) in \(C_8\)-free graphs

Zian Chen, Jinghua Deng

For graphs $F$ and $H$, let $\ex(n,F,H)$ denote the maximum number of copies of $F$ in an $n$-vertex $H$-free graph. Gerbner, Győri, Methuku and Vizer proved that $\ex(n,C_6,C_8)=…