Extremal graphs for odd-ballooning of paths and cycles
type: Item
instance of: scholarly article
title: Extremal graphs for odd-ballooning of paths and cycles
zbMATH Open document ID: 1442.05109
author: Hui Zhu
author: Erfang Shan
author: Liying Kang
published in: Graphs and Combinatorics
publication date: 2020-04-30T00:00:00Z
review text: The odd-ballooning of a graph \(G\) is the graph obtained from \(G\) by replacing each edge in \(G\) by an odd cycle of length between \(3\) and \(q\) (\(q\geq 3\)), where the new vertices of the odd cycles are all different. Given a graph \(H\) and a positive integer \(n\), the extremal number, \(ex(n, H)\), is the maximum number of edges in a graph on \(n\) vertices that does not contain \(H\) as a subgraph. In this paper, the authors determine the extremal number and find the extremal graphs for odd-ballooning of paths and cycles, when replacing each edge of the paths or the cycles by an odd cycle of length between \(3\) and \(q\) (\(q\geq 3\)), and \(n\) is sufficiently large.
reviewed by: Juan José Montellano-Ballesteros
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 7195261
zbMATH Keywords: extremal graph
zbMATH Keywords: Turán graph
zbMATH Keywords: odd-ballooning
MaRDI profile type: MaRDI publication profile
full work available at URL: s00373-020-02150-3
OpenAlex ID: W3010837508
cites work: Extremal graphs for intersecting cliques
cites work: Extremal graphs for intersecting triangles
cites work: Extremal graph for intersecting odd cycles
cites work: Turán number and decomposition number of intersecting odd cycles
cites work: Extremal graphs for blow-ups of cycles and trees
cites work: Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
cites work: Q5781249
cites work: On the theory of graphs
DOI: 10.1007/S00373-020-02150-3
description: scientific article; zbMATH DE number 7195261