The Turán number of star forests

DOI10.1016/j.amc.2018.12.004zbMath1428.05153OpenAlexW2904550927MaRDI QIDQ2008823

Yongxin Lan, Tao Li, Yongtang Shi, Jian-hua Tu

Publication date: 26 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.12.004

zbMATH Keywords

extremal graphsTurán numberstar forests

Mathematics Subject Classification ID

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

Related Items (12)

The Turán numbers of special forests ⋮ A note on the Turán number of an arbitrary star forest ⋮ The Turán number for \(4 \cdot S_{\ell}^1\) ⋮ On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\) ⋮ On the spectral radius of graphs without a star forest ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ The Turán number of \(k \cdot S_\ell \) ⋮ Some new results on the Turán number of star forests ⋮ Two results about the Turán number of star forests ⋮ On the Turán number of theta graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• Subtrees and subforests of graphs
• The Turán number of disjoint copies of paths
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• On Independent Complete Subgraphs in a Graph
• On the theory of graphs
• On the structure of linear graphs

This page was built for publication: The Turán number of star forests