The Turán number of path-star forests
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915056380280832 |
|---|---|
| author | Fang, Xiaona Chen, Yaojun You, Lihua |
| author_facet | Fang, Xiaona Chen, Yaojun You, Lihua |
| contents | The Turán number of a graph $H$, denoted by $ex(n,H)$, is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. A linear (star) forest is a forest consisting of paths (stars). A path-star forest $F$ is a forest consisting of paths and stars. In this paper, we determine $ex(n,F)$ for sufficiently large $n$ and characterize the corresponding extremal graphs, and our result generalizes previous known results on the Turán numbers of linear forests and star forests. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_11680 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | The Turán number of path-star forests Fang, Xiaona Chen, Yaojun You, Lihua Combinatorics 05C05, 05C35 The Turán number of a graph $H$, denoted by $ex(n,H)$, is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. A linear (star) forest is a forest consisting of paths (stars). A path-star forest $F$ is a forest consisting of paths and stars. In this paper, we determine $ex(n,F)$ for sufficiently large $n$ and characterize the corresponding extremal graphs, and our result generalizes previous known results on the Turán numbers of linear forests and star forests. |
| title | The Turán number of path-star forests |
| topic | Combinatorics 05C05, 05C35 |
| url | https://arxiv.org/abs/2305.11680 |