References & Citations
Mathematics > Combinatorics
Title: Extremal graphs for the odd prism
(Submitted on 7 Feb 2023 (v1), last revised 5 Feb 2024 (this version, v2))
Abstract: The Tur\'an number $\mathrm{ex}(n,H)$ of a graph $H$ is the maximum number of edges in an $n$-vertex graph which does not contain $H$ as a subgraph. The Tur\'{a}n number of regular polyhedrons was widely studied in a series of works due to Simonovits. In this paper, we shall present the exact Tur\'{a}n number of the prism $C_{2k+1}^{\square} $, which is defined as the Cartesian product of an odd cycle $C_{2k+1}$ and an edge $ K_2 $. Applying a deep theorem of Simonovits and a stability result of Yuan [European J. Combin. 104 (2022)], we shall determine the exact value of $\mathrm{ex}(n,C_{2k+1}^{\square})$ for every $k\ge 1$ and sufficiently large $n$, and we also characterize the extremal graphs. Moreover, in the case of $k=1$, motivated by a recent result of Xiao, Katona, Xiao and Zamora [Discrete Appl. Math. 307 (2022)], we will determine the exact value of $\mathrm{ex}(n,C_{3}^{\square} )$ for every $n$ instead of for sufficiently large $n$.
Submission history
From: Yongtao Li [view email][v1] Tue, 7 Feb 2023 06:05:35 GMT (472kb,D)
[v2] Mon, 5 Feb 2024 13:42:41 GMT (473kb,D)
Link back to: arXiv, form interface, contact.