Name
Abstract | ||
|---|---|---|
The Turan number of a graph H, denoted by ex(n, H), is the maximum number of edges of an n-vertex simple graph having no H as a subgraph. Let S-l denote the star on l + 1 vertices, and let k center dot S-l denote k disjoint copies of S-l. Erdos and Gallai determined the value ex(n, k center dot S-1) for all positive integers k and n. Yuan and Zhang determined the value ex(n, k center dot S-2) and characterized all extremal graphs for all positive integers k and n. Recently, Lan et al. determined the value ex(n, 2 center dot S-3) for all positive integers n, and Li and Yin determined the values ex(n, k center dot S-l) for k = 2, 3 and all positive integers l and n. In this paper, we further determine the value ex(n, 4 center dot S-l) for all positive integers l and almost all n, improving one of the results of LidickATIN SMALL LETTER Y WITH ACUTE et al. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.7151/dmgt.2338 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | DocType | Volume |
Turan number, disjoint copies, k, S-l | Journal | 42 |
Issue | ISSN | Citations |
4 | 1234-3099 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sha-Sha Li | 1 | 1 | 0.77 |
| Jian-Hua Yin | 2 | 1 | 0.77 |
| Jia-Yun Li | 3 | 1 | 0.77 |