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

Abstract

AbstractGiven a graph , the Turán number is the maximum possible number of edges in an ‐vertex ‐free graph. The study of Turán number of graphs is a central topic in extremal graph theory. Although the celebrated Erdős‐Stone‐Simonovits theorem gives the asymptotic value of for nonbipartite , it is challenging in general to determine the exact value of for . The odd‐ballooning of is a graph such that each edge of is replaced by an odd cycle and all new vertices of odd cycles are distinct. Here the length of odd cycles is not necessarily equal. The exact value of Turán number of the odd‐ballooning of is previously known for being a cycle, a path, a tree with assumptions, and . In this paper, we manage to obtain the exact value of Turán number of the odd‐ballooning of with , where and each odd cycle has length at least five.