The Planar Turán Number of $Θ_6$-graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916304911335424 |
|---|---|
| author | Guan, David Győri, Ervin Luong-Le, Diep Wang, Felicia Yang, Mengyuan |
| author_facet | Guan, David Győri, Ervin Luong-Le, Diep Wang, Felicia Yang, Mengyuan |
| contents | There are two particular $Θ_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Turán number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $Θ_6$ as a subgraph and we find infinitely many extremal constructions showing the sharpness of these results - apart from a small additive constant error in one of the cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_19584 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Planar Turán Number of $Θ_6$-graphs Guan, David Győri, Ervin Luong-Le, Diep Wang, Felicia Yang, Mengyuan Combinatorics There are two particular $Θ_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Turán number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $Θ_6$ as a subgraph and we find infinitely many extremal constructions showing the sharpness of these results - apart from a small additive constant error in one of the cases. |
| title | The Planar Turán Number of $Θ_6$-graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.19584 |