The planar Turán number of double star $S_{2,4}$
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913875864059904 |
|---|---|
| author | Xu, Xin Shao, Jiawei |
| author_facet | Xu, Xin Shao, Jiawei |
| contents | Planar Turán number $ex_{\mathcal{P}}(n,H)$ of $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. In this paper, we prove that $ex_{\mathcal{P}}(n,S_{2,4})\leq \frac{31}{14}n$ for $n\geq 1$, and show that equality holds for infinitely many integers $n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_01016 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The planar Turán number of double star $S_{2,4}$ Xu, Xin Shao, Jiawei Combinatorics Planar Turán number $ex_{\mathcal{P}}(n,H)$ of $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. In this paper, we prove that $ex_{\mathcal{P}}(n,S_{2,4})\leq \frac{31}{14}n$ for $n\geq 1$, and show that equality holds for infinitely many integers $n$. |
| title | The planar Turán number of double star $S_{2,4}$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2409.01016 |