Back to Search
Start Over
Outerplanar Tur\'{a}n numbers of cycles and paths
- Publication Year :
- 2021
-
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\'{a}n number of a given graph $H$, denoted by ${\rm ex}_{\mathcal{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\'{a}n numbers of cycles and paths are completely determined.<br />Comment: 18 pages, 6 figures
- Subjects :
- Mathematics - Combinatorics
05C35, 05C38
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2110.10410
- Document Type :
- Working Paper