On the Turán number of odd-ballooning of $3$-chromatic graphs

Longfei Fang, Xueyi Huang, Huiqiu Lin +1

Given a graph $F$, the Turán number $\mathrm{ex}(n,F)$ is the maximum number of edges in any $n$-vertex $F$-free graph. The odd-ballooning of $F$, denoted by $F^o$, is a graph obta…