Outerplanar Tur\'{a}n numbers of cycles and paths

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 exOP(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.

[1]  Zoltán Füredi,et al.  Extremal Numbers for Odd Cycles , 2013, Combinatorics, Probability and Computing.

[2]  Kiran S. Kedlaya Outerplanar Partitions of Planar Graphs , 1996, J. Comb. Theory, Ser. B.

[3]  Generalised outerplanar Turán numbers and maximum number of k-vertex subtrees , 2021, Discrete Applied Mathematics.

[4]  Lawrence Wargo A characterization of α-outerplanar graphs , 1996, J. Graph Theory.

[5]  Yongtang Shi,et al.  Planar Turán Numbers of Short Paths , 2019, Graphs and Combinatorics.

[6]  M. Simonovits,et al.  The History of Degenerate (Bipartite) Extremal Graph Problems , 2013, 1306.5167.

[7]  Michael Tait,et al.  Three conjectures in extremal spectral graph theory , 2016, J. Comb. Theory, Ser. B.

[8]  C. N. Campos,et al.  On dominating sets of maximal outerplanar graphs , 2013, Discret. Appl. Math..

[9]  Ervin GyHori,et al.  Generalized outerplanar Tur\'an number of short paths , 2021 .

[10]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[11]  Chris Dowden,et al.  Extremal C4‐Free/C5‐Free Planar Graphs , 2015, J. Graph Theory.

[12]  Yongtang Shi,et al.  Extremal H-Free Planar Graphs , 2018, Electron. J. Comb..

[13]  A complete solution to the Cvetković–Rowlinson conjecture , 2021, J. Graph Theory.

[14]  H. Whitney Congruent Graphs and the Connectivity of Graphs , 1932 .

[15]  Richard H. Schelp,et al.  Path Ramsey numbers in multicolorings , 1975 .

[16]  Yongtang Shi,et al.  Planar Tur\'an numbers for Theta graphs and paths of small order , 2017 .

[17]  Ryan R. Martin,et al.  Planar Turán Number of the 6-Cycle , 2020, SIAM J. Discret. Math..