The Turán number
is the maximum number of edges in an
‐free graph on
vertices. Let
be any tree. The odd‐ballooning of
, denoted by
, is a graph obtained by replacing each edge of
with an odd cycle containing the edge, and all new vertices of the odd cycles are distinct. In this paper, we determine the exact value of
...