Outerplanar Turán numbers of cycles and paths

2021/10/20 by Fang, Longfei, Zhai, Mingqing · 1 citation
#05C35 #05C38 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2110.10410

Abstract

A graph is outerplanar if it can be embedded in a plane such that all vertices lie on its outer face. The outerplanar Turán number of a given graph H, denoted by \rm ex_OP(n,H), is the maximum number of edges over all outerplanar graphs on n vertices which do not contain a copy of H. In this paper, the outerplanar Turán numbers of cycles and paths are completely determined.

Cited by

• Planar Turán numbers of three configurations

Related

• Outerplanar Turán number of a cycle
• Generalized outerplanar Turán number of short paths
• Generalized Outerplanar Turán numbers and maximum number of k-vertex subtrees
• The planar Turán number of the seven-cycle
• An improved lower bound for the planar Turán number of cycles