# Counting paths, cycles, and blow‐ups in planar graphs

```@inproceedings{Cox2022CountingPC,
title={Counting paths, cycles, and blow‐ups in planar graphs},
author={Christopher Cox and Ryan R. Martin},
year={2022}
}```
• Published 14 January 2021
• Mathematics
For a planar graph H , let N P ( n, H ) denote the maximum number of copies of H in an n -vertex planar graph. In this paper, we prove that N P ( n, P 7 ) ∼ 427 n 4 , N P ( n, C 6 ) ∼ ( n/ 3) 3 , N P ( n, C 8 ) ∼ ( n/ 4) 4 and N P ( n, K 4 { 1 } ) ∼ ( n/ 6) 6 , where K 4 { 1 } is the 1-subdivision of K 4 . In addition, we obtain signiﬁcantly improved upper bounds on N P ( n, P 2 m +1 ) and N P ( n, C 2 m ) for m ≥ 4. For a wide class of graphs H , the key technique developed in this paper…
The maximum number of 10- and 12-cycles in a planar graph
• Mathematics
• 2021
For a fixed planar graph H , let NP(n,H) denote the maximum number of copies of H in an n-vertex planar graph. In the case when H is a cycle, the asymptotic value of NP(n,Cm) is currently known for m
Planar graphs with the maximum number of induced 6-cycles
For large n we determine the maximum number of induced 6-cycles which can be contained in a planar graph on n vertices, and we classify the graphs which achieve this maximum. In particular we show
Generalized outerplanar Tur\'an number of short paths
• Mathematics
• 2021
Let H be a graph. The generalized outerplanar Turán number of H, denoted by fOP(n,H), is the maximum number of copies of H in an n-vertex outerplanar graph. Let Pk be the path on k vertices. In this
Generalized Planar Turán Numbers
• Mathematics
Electron. J. Comb.
• 2021
In a generalized Turán problem, we are given graphs \$H\$ and \$F\$ and seek to maximize the number of copies of \$H\$ in an \$n\$-vertex graph not containing \$F\$ as a subgraph. We consider generalized Turán
The Maximum Number of Paths of Length Three in a Planar Graph
• Mathematics
• 2019
Let \$f(n,H)\$ denote the maximum number of copies of \$H\$ in an \$n\$-vertex planar graph. The order of magnitude of \$f(n,P_k)\$, where \$P_k\$ is a path of length \$k\$, is
The maximum number of induced C5 's in a planar graph
• Mathematics
J. Graph Theory
• 2022
Finding the maximum number of induced cycles of length k in a graph on n vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, Hu, Lidický and Pfender
Planar graphs with the maximum number of induced 4-cycles or 5-cycles
For large n we determine exactly the maximum numbers of induced C4 and C5 subgraphs that a planar graph on n vertices can contain. We show that K2,n−2 uniquely achieves this maximum in the C4 case,