Planar Turán number for balanced double stars
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917688859688960 |
|---|---|
| author | Xu, Xin Zhou, Qiang Li, Tong Yan, Guiying |
| author_facet | Xu, Xin Zhou, Qiang Li, Tong Yan, Guiying |
| contents | Planar Turán number, denoted by $ex_{\mathcal{P}}(n,H)$, is the maximum number of edges in an $n$-vertex planar graph which does not contain $H$ as a subgraph. Ghosh, Győri, Paulos and Xiao initiated the topic of the planar Turán number for double stars. For balanced double star, $S_{3,3}$ is the only remaining graph need to be considered. In this paper, we give the exact value of $ex_{\mathcal{P}}(n,S_{3,3})$, forcing the planar Turán number for all balanced double stars completely determined. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_05758 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Planar Turán number for balanced double stars Xu, Xin Zhou, Qiang Li, Tong Yan, Guiying Combinatorics Planar Turán number, denoted by $ex_{\mathcal{P}}(n,H)$, is the maximum number of edges in an $n$-vertex planar graph which does not contain $H$ as a subgraph. Ghosh, Győri, Paulos and Xiao initiated the topic of the planar Turán number for double stars. For balanced double star, $S_{3,3}$ is the only remaining graph need to be considered. In this paper, we give the exact value of $ex_{\mathcal{P}}(n,S_{3,3})$, forcing the planar Turán number for all balanced double stars completely determined. |
| title | Planar Turán number for balanced double stars |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.05758 |