On the generalized Turán number of the complete bipartite graph $K_{3,b+1}$

Jing Wang, Zixuan Yang, Junpeng Zhou

For graphs $F$ and $H$, let $\mathrm{ex}(n,H,F)$ denote the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Very recently, Janzer, Longbrake, and Yepremyan proved…