The Planar Tur\'an Number of 6-graphs
Abstract
There are two particular 6-graphs - the 6-cycle graphs with a diagonal. We find the planar Tur\'an number of each of them, i.e. the maximum number of edges in a planar graph G of n vertices not containing the given 6 as a subgraph and we find infinitely many extremal constructions showing the sharpness of these results - apart from a small additive constant error in one of the cases.
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.