betaFeedback

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 k≥1k\geq1 be fixed, and let FoF^o be a prescribed odd-ballooning of the odd prism C2k+1□K2C_{2k+1}\square K_2, in which each edge is replaced by a cycle of prescribed odd length at least five. For all sufficiently large nn, we prove that ex(n,Fo)=⌊n24⌋+(k+1)n−3(k+1)2.{\rm ex}(n,F^o)=\Big\lfloor\frac{n^2}{4}\Big\rfloor+(k+1)n-3(k+1)^2. Furthermore, the unique extremal graph is K 2k+2, ⌊(n−2k−2)/2⌋, ⌈(n−2k−2)/2⌉K_{\,2k+2,\,\lfloor(n-2k-2)/2\rfloor,\,\lceil(n-2k-2)/2\rceil}. The proof combines the decomposition-family method and Simonovits' structural theorem with local embedding arguments to establish the extremal structure and its uniqueness.

Paper details

vlnc:W_3w7qagk7
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…