Extremal graphs for odd-ballooning of bipartite graphs

arXiv2207.01759MaRDI QIDQ6403985FDOQ6403985

Authors: Yanni Zhai, Xiying Yuan 

Publication date: 4 July 2022

Abstract: Given a graph $H$ and an odd integer $t$ ($tgeq3$), the odd-ballooning of $H$, denoted by $H(t)$, is the graph obtained from replacing each edge of $H$ by an odd cycle of length at least $t$ where the new vertices of the cycles are all distinct. In this paper, we determine the range of Tur'{a}n numbers for odd-ballooning of bipartite graphs when $tgeq5$. As applications, we may deduce the Tur'{a}n numbers for odd-ballooning of stars, paths and even cycles.

This page was built for publication: Extremal graphs for odd-ballooning of bipartite graphs

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