Turán Problems for Suspension of a Balanced Tree
Journal of Graph Theory · 2026-09 · 113 (1) · 61-72
DOI: 10.1002/jgt.70053 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 24.04.2026. Verfasst von Xiutao Zhu und 3 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
The Turán number is the maximum number of edges that an ‐vertex ‐free graph can have. The suspension is obtained from by adding a new vertex which is adjacent to all vertices of and a tree is balanced if the size of one color class is and the other is or . In this paper, we obtain a sharp bound of when based on the Erdős‐Sós Conjecture. We also show the bound is sharp for infinitely many and characterize all extremal graphs. In particular, if satisfies some conditions such as contains a matching covering all vertices in one color class, then the bound is sharp for all . This is a new class of graphs whose decomposition family does not contain a linear forest but we still can determine its Turán number.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Zhu, X., Wang, X., Zhang, Y., & Zhang, F. (2026). Turán Problems for Suspension of a Balanced Tree. Journal of Graph Theory, 113(1), 61-72. https://doi.org/10.1002/jgt.70053
Vancouver
Zhu X, Wang X, Zhang Y, Zhang F. Turán Problems for Suspension of a Balanced Tree. Journal of Graph Theory. 2026;113(1):61-72. doi:10.1002/jgt.70053
BibTeX
@article{Zhu2026,
author = {Zhu, Xiutao and Wang, Xiaolin and Zhang, Yanbo and Zhang, Fangfang},
title = {Turán Problems for Suspension of a Balanced Tree},
journal = {Journal of Graph Theory},
year = {2026},
volume = {113},
number = {1},
pages = {61--72},
doi = {10.1002/jgt.70053}
}
EUVIMED