Turán number of the odd-ballooning of complete bipartite graphs

Xing Peng, Mengjie Xia

Given a graph $L$, the Turán number $\text{ex}(n,L)$ is the maximum possible number of edges in an $n$-vertex $L$-free graph. The study of Turán number of graphs is a central top…