Outerplanar Tur\'an numbers of cycles and paths
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\'an 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\'an numbers of cycles and paths are completely determined.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.