WorksMathematics
Turán number of the odd-ballooning of odd prisms
Abstract
The Turán problem for odd-balloonings has been studied for various classes of skeleton graphs, including stars, paths, cycles, trees, bipartite graphs, and certain 3-chromatic graphs. The Turán numbers and extremal graphs for odd prisms have also been determined. Motivated by these developments, we investigate the Turán problem for prescribed odd-balloonings of odd prisms. Let be fixed, and let be a prescribed odd-ballooning of the odd prism , in which each edge is replaced by a cycle of prescribed odd length at least five. For all sufficiently large , we prove that Furthermore, the unique extremal graph is . The proof combines the decomposition-family method and Simonovits' structural theorem with local embedding arguments to establish the extremal structure and its uniqueness.