Turán number of the odd-ballooning of complete bipartite graphs

DOI10.1002/jgt.23118zbMATH Open1546.05077MaRDI QIDQ6595522

Xing Peng, Mengjie Xia

Publication date: 30 August 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

Turán numberdecomposition familyodd-ballooning of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal graph for intersecting odd cycles
• Degrees and matchings
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Extremal graphs for blow-ups of cycles and trees
• Extremal graphs of the \(p\)th power of paths
• Extremal graphs for odd-ballooning of paths and cycles
• The Turán number for the edge blow-up of trees
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Turán number and decomposition number of intersecting odd cycles
• Intersection theorems for systems of sets
• Extremal graphs for blow-ups of keyrings
• Extremal graphs for edge blow-up of graphs
• The Turán number for the edge blow-up of trees: the missing case
• Extremal graphs for the k‐flower
• On the structure of linear graphs
• Extremal graphs for odd wheels
• Turán number for odd‐ballooning of trees

This page was built for publication: Turán number of the odd-ballooning of complete bipartite graphs