Let F be a nonempty family of graphs. A graph 𝐺 is called F -free if it contains no graph from F as a subgraph. For a positive integer 𝑛, the planar Turán number of F, denoted by exp (𝑛, F), is the maximum number of edges in an 𝑛-vertex F -free planar graph.
Let Θ𝑘 be the family of Theta graphs on 𝑘 ≥ 4 vertices, that is, graphs obtained by joining a pair of non-consecutive of a 𝑘-cycle with an edge. Lan, Shi and Song determined an upper bound exp (𝑛, Θ6) ≤ 18𝑛/7−36𝑛/7, but for large 𝑛, they did not verify that the bound is sharp. In this paper, we improve their bound by proving exp (𝑛, Θ6) ≤ 18𝑛/−48𝑛/7 and then we demonstrate the existence of infinitely many positive integer 𝑛 and an 𝑛-vertex Θ6-free planar graph attaining the bound.
C. Dowden. Extremal 𝐶4-free/𝐶5-free planar graphs. Journal of Graph Theory, 83:213–230, 2016.
P. Erdős. On the structure of linear graphs. Israel Journal of Mathematics, 1:156–160, 1963.
P. Erdős. On the number of complete subgraphs contained in certain graphs. Publ. Math. Inst. Hung. Acad. Sci., 7:459–464, 1962.
L. Fang, B. Wang, and M. Zhai. Planar Turán number of intersecting triangles. Discrete Math., 345(5):112794, 2022.
D. Ghosh, E. Győri, A. Paulos, and C. Xiao. Planar Turán Number of Double Stars. https://arxiv.org/abs/2006.00994, 2022
D. Ghosh, E. Győri, R. R. Martin, A. Paulos, and C. Xiao. Planar Turán Number of the 6-Cycle. SIAM Journal on Discrete Mathematics, 36(3):2028–2050, 2022.
Y. Lan, Y. Shi, and Z.-X. Song. Extremal 𝐻-free planar graphs. The Electronic Journal of Combinatorics, 26(2):#P2.11, 2019.
Y. Lan, Y. Shi, and Z.-X. Song. Extremal theta-free planar graphs. Discrete Mathematics, 342(12):no. 111610, 2019.
P. Turán. On an extremal problem in graph theory. Matematikai és Fizikai Lapok (In Hungarian), 48:436–452, 1941.
A. Zykov. On some properties of linear complexes. Mat. Sb. (N.S.), 24(66):163–188, 1949.