Metraipolis › archive › dc_d8d801dee3de

Sharp planar Turán bounds for quasi-double stars — arXiv:2610.05706

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.05706
License (as archived)
CC0-1.0
Archived
2026-10-06T16:52:10.808Z
SHA-256 of the archived text
cae0336b5dfbb5b97c11a46e940f85e55c2e52005e8e708a42e1d7333bb4c8fc
Stable URL of this page
https://metraipolis.com/documento/dc_d8d801dee3de

How to cite

Sharp planar Turán bounds for quasi-double stars — arXiv:2610.05706 — arXiv (en), https://arxiv.org/abs/2610.05706 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d8d801dee3de (Metraipolis archive dc_d8d801dee3de, sha256 cae0336b5dfbb5b97c11a46e940f85e55c2e52005e8e708a42e1d7333bb4c8fc)
BibTeX
@misc{dcd8d801dee3de,
  title = {Sharp planar Turán bounds for quasi-double stars — arXiv:2610.05706},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.05706},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d8d801dee3de; sha256 cae0336b5dfbb5b97c11a46e940f85e55c2e52005e8e708a42e1d7333bb4c8fc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05706. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study $W$-free planar graphs for $W\in\{W_{2,4},W_{2,5},W_{3,4}\}$, where the quasi-double star $W_{h,k}$ is obtained from a three-vertex path by attaching $h$ leaves to one endpoint and $k$ leaves to the other. We prove that every $W_{2,4}$-free planar graph on $n$ vertices has at most $9n/4$ edges, and the bound is attained whenever $8\mid n$. This determines the planar Turán density of $W_{2,4}$ as $9/4$. We also establish the sharp upper bound $5n/2$ for $W_{2,5}$. Combined with known constructions of planar graphs of maximum degree five, it yields $\ex_{\PP}(n,W_{2,5})=\lfloor5n/2\rfloor$ for every $n\ge15$. These results close the two corresponding coefficient gaps in the bounds of Liu et~al. Our proofs use structural restrictions on high-degree vertices, local deletions, and degree deficits in neighborhoods of radius two. For $W_{3,4}$, we characterize the planar graphs with a dominating vertex that avoid this tree and determine their exact extremal number, $\lfloor(5n-7)/2\rfloor$, for every $n\ge10$. Finally, $W$-free planar triangulations have at most eight, twelve, and eleven vertices for $W=W_{2,4},W_{2,5},W_{3,4}$, respectively; the first two bounds are sharp.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.05706 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:19:20.004Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).