Extremal graphs for odd-ballooning of paths and cycles
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.
- Extremal graph for intersecting odd cycles
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Extremal graphs for blow-ups of cycles and trees
- Extremal graphs for intersecting cliques
- Extremal graphs for intersecting triangles
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- On the theory of graphs
- Turán number and decomposition number of intersecting odd cycles
- Extremal graphs for blow-ups of cycles and trees
- The Turán number for the edge blow-up of trees
- Extremal graphs for edge blow-up of graphs
- Extremal graphs for odd wheels
- Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star
- Turán number of the odd-ballooning of complete bipartite graphs
- Extremal graphs for blow-ups of stars and paths
This page was built for publication: Extremal graphs for odd-ballooning of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175804)
