Turán number for odd‐ballooning of trees

DOI10.1002/jgt.22959zbMath1522.05043arXiv2207.11506OpenAlexW4362671321MaRDI QIDQ6094026

Yaojun Chen, Xiutao Zhu

Publication date: 9 October 2023

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

Full work available at URL: https://arxiv.org/abs/2207.11506

zbMATH Keywords

treeTurán numberodd-ballooningdecomposition family

Mathematics Subject Classification ID

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

Related Items (1)

Edges Not Covered by Monochromatic Bipartite Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal graph for intersecting odd cycles
• On edges not in monochromatic copies of a fixed bipartite graph
• Degrees and matchings
• Extremal graphs for intersecting cliques
• On the number of edges not covered by monochromatic copies of a fixed graph.
• Edges not in any monochromatic copy of a fixed graph
• Extremal graphs for intersecting triangles
• Extremal graphs for blow-ups of cycles and trees
• 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 edge blow-up of graphs
• Extremal graphs for the k‐flower
• On the structure of linear graphs

This page was built for publication: Turán number for odd‐ballooning of trees