Planar Turán number of intersecting triangles

DOI10.1016/J.DISC.2021.112794zbMATH Open1484.05101arXiv2007.09650OpenAlexW4229043641MaRDI QIDQ2113345FDOQ2113345

Longfei Fang, Bing Wang, Mingqing Zhai

Publication date: 14 March 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: The planar Tur'{a}n number of a given graph $H$, denoted by $e{x}_{mathcalP}(n,H)$, is the maximum number of edges over all planar graphs on $n$ vertices that do not contain a copy of $H$ as a subgraph. Let $H_k$ be a friendship graph, which is obtained from $k$ triangles by sharing a common vertex. In this paper, we obtain sharp bounds of $e{x}_{mathcalP}(n,H_k)$ and $e{x}_{mathcalP}(n,K_1+P_{k+1})$ for $kge2$, which improves the results of Lan and Shi in Electron. J. Combin. 26 (2) (2019), #P2.11.

Full work available at URL: https://arxiv.org/abs/2007.09650

Recommendations

• Planar Turán numbers on short cycles of consecutive lengths
• Planar Turán numbers of short paths
• Planar Turán number of the 6-cycle
• Generalized planar Turán numbers
• The maximum number of triangles in \(F_k\)-free graphs

zbMATH Keywords

planar graphfriendship graphTurán number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Extremal \(H\)-free planar graphs
• Extremal graphs for odd wheels
• Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
• Extremal Theta-free planar graphs

Cited In (6)

• Planar Turán Number of the 6-Cycle
• Planar Turán number of the disjoint union of cycles
• Planar Turán numbers of cycles: a counterexample
• Planar Turán numbers on short cycles of consecutive lengths
• The Turán number of the triangular pyramid of 3-layers
• Planar Turán numbers of cubic graphs and disjoint union of cycles

This page was built for publication: Planar Turán number of intersecting triangles

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