Extremal graphs for odd-ballooning of paths and cycles

DOI10.1007/S00373-020-02150-3zbMATH Open1442.05109OpenAlexW3010837508MaRDI QIDQ2175804FDOQ2175804

Authors: Hui Zhu, Erfang Shan, Liying Kang 

Publication date: 30 April 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02150-3

Recommendations

• Turán number for odd‐ballooning of trees
• Extremal graphs for blow-ups of cycles and trees
• Extremal graphs for blow-ups of stars and paths
• Extremal graphs for blow-ups of keyrings
• Extremal numbers for odd cycles

zbMATH Keywords

extremal graphodd-ballooningTurán graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Extremal graphs for blow-ups of cycles and trees
• Extremal graph for intersecting odd cycles
• On the theory of graphs
• Turán number and decomposition number of intersecting odd cycles
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions

Cited In (5)

• Extremal graphs for odd wheels
• The Turán number for the edge blow-up of trees
• Turán number of the odd-ballooning of complete bipartite graphs
• Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star
• Extremal graphs for edge blow-up of graphs

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)