Extremal graphs for odd-ballooning of paths and stars
arXiv:2205.10048
Abstract
The odd-ballooning of a graph , denoted by , is the graph obtained from replacing each edge in by a odd cycle of the same size where the new vertices of the odd cycles are all different. In 2002, Erdös et al. determined the extremal graphs of -fan. In 2016, Hou et al. determined extremal graphs of the odd-ballooning of stars for . In 2020, Zhu et al. determined extremal graphs of the odd-ballooning of paths for . In this article, we use progressive induction lemma of Simonovits to determine the extremal graphs of both odd-ballooning of stars and odd-ballooning of paths for .
This version of the article has some bugs and we would like to withdraw it