Tur\'an number of the odd-ballooning of complete bipartite graphs

arXiv2307.04984MaRDI QIDQ6443263FDOQ6443263

Authors: Xing Peng, Mengjie Xia 

Publication date: 10 July 2023

Abstract: Given a graph $L$, the Tur'an number $extrmex(n,L)$ is the maximum possible number of edges in an $n$-vertex $L$-free graph. The study of Tur'an number of graphs is a central topic in extremal graph theory. Although the celebrated ErdH{o}s-Stone-Simonovits theorem gives the asymptotic value of $extrmex(n,L)$ for nonbipartite $L$, it is challenging in general to determine the exact value of $extrmex(n,L)$ for $chi(L)geq3$. The odd-ballooning of $H$ is a graph such that each edge of $H$ 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'an number of the odd-ballooning of $H$ is previously known for $H$ being a cycle, a path, a tree with assumptions, and $K_{2,3}$. In this paper, we manage to obtain the exact value of Tur'an number of the odd-ballooning of $K_{s,t}$ with $2leqsleqt$, where $(s,t)otin(2,2),(2,3)$ and each odd cycle has length at least five.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

This page was built for publication: Tur\'an number of the odd-ballooning of complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6443263)