Turán number of the odd-ballooning of odd prisms

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\geq1$ be fixed, and let $F^o$ be a prescribed odd-ballooning of the odd prism $C_{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 $n$, we prove that $${\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,\,\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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24048
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Turán number of the odd-ballooning of odd prisms

Longfei Fang, Yuke Zhang, Wenwen Chen
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Turán number of the odd-ballooning of odd prisms

Longfei Fang, Yuke Zhang, Wenwen Chen
preprint en

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\geq1$ be fixed, and let $F^o$ be a prescribed odd-ballooning of the odd prism $C_{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 $n$, we prove that $${\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,\,\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.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon