Induced planar Turán numbers
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913069696811008 |
|---|---|
| author | Győri, Ervin Karim, Hilal Hama |
| author_facet | Győri, Ervin Karim, Hilal Hama |
| contents | The planar Turá number of a graph $F$ is the maximum number of edges an $n$-vertex $F$-free planar graph can have. We study the case where $F$ is forbidden as an induced subgraph, thereby introducing the induced planar Turá numbers. We will determine a sharp upper bound when $F$ is $Θ_4$, a $4$-cycle with a diagonal edge, and obtain exact extremal values in case $F$ is a path $P_k$ on $k$ vertices, for $k=3,4$ and $5$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_25829 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Induced planar Turán numbers Győri, Ervin Karim, Hilal Hama Combinatorics 05C35 The planar Turá number of a graph $F$ is the maximum number of edges an $n$-vertex $F$-free planar graph can have. We study the case where $F$ is forbidden as an induced subgraph, thereby introducing the induced planar Turá numbers. We will determine a sharp upper bound when $F$ is $Θ_4$, a $4$-cycle with a diagonal edge, and obtain exact extremal values in case $F$ is a path $P_k$ on $k$ vertices, for $k=3,4$ and $5$. |
| title | Induced planar Turán numbers |
| topic | Combinatorics 05C35 |
| url | https://arxiv.org/abs/2604.25829 |