Extremal planar graphs with no cycles of particular lengths

arXiv2208.13477MaRDI QIDQ6409110FDOQ6409110

Authors: Ervin Győri, Xian-Zhi Wang, Zeyu Zheng 

Publication date: 29 August 2022

Abstract: In this paper we estimate the planar Tur'an number $mathrm{ex}_{m}athcalP(n,H)$ of some graphs $H$, i.e., the maximum number of edges in a planar graph $G$ of $n$ vertices not containing $H$ as a subgraph. We give a new, short proof when $H=C_5$, and study the cases when $G$ is bipartite or triangle-free and $H$ is a short even cycle. The proofs are mostly new applications or variants of the "contribution method" introduced by Ghosh, GyH{o}ri, Martin, Paulos and Xiao in arXiv:2004.14094.

This page was built for publication: Extremal planar graphs with no cycles of particular lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409110)